Sara Asensio

activity

20242026

collaborators

5 papers

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.AC2026

Generalized Andrásfai graphs and special Betti diagrams of edge ideals

Sara Asensio, Ignacio García-Marco, Philippe Gimenez

Edge ideals of graphs were introduced by Villarreal in 1990, and have been the subject of many studies since then. In the same year, Fröberg characterized edge ideals with regulari…

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