Sara Asensio

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Rings are $χ$ -bounded

Sara Asensio, Ignacio García-Marco, Kolja Knauer

We prove that there is a function $f : N \to N$ such that $χ (Γ (R)) \leq f (ω (Γ (R)))$ for the zero-divisor graph of any ring $R$ , if the clique number is finite. On the on…

math.CO2026

Edge codes constructed from unicyclic graphs

Sara Asensio, Giulia Gaggero, Naveena Ragunathan +2

Jaramillo-Velez recently introduced edge codes, a new class of toric evaluation codes constructed from the edges of a (hyper)graph $H$ . In the case that $H$ is…

math.CO2025

Sensitivity and Hamming graphs

Sara Asensio, Yuval Filmus, Ignacio García-Marco +1

For any $m \geq 3$ we show that the Hamming graph $H (n, m)$ admits an imbalanced partition into $m$ sets, each inducing a subgraph of low maximum degree. This improves previous resul…

math.CO2024

Sensitivity of $m$ -ary functions and low degree partitions of Hamming graphs

Sara Asensio, Ignacio García-Marco, Kolja Knauer

The study of complexity measures of Boolean functions led Nisan and Szegedy to state the sensitivity conjecture in 1994, claiming a polynomial relation between degree and sensitivi…

Rings are χ-bounded

Edge codes constructed from unicyclic graphs

Sensitivity and Hamming graphs

Sensitivity of m-ary functions and low degree partitions of Hamming graphs

Rings are $χ$ -bounded

Sensitivity of $m$ -ary functions and low degree partitions of Hamming graphs