3 papers
math.CO2026
Piercing all maximum cliques in hypergraphs
Andreas Holmsen, Attila Jung, Balázs Keszegh +2
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single ver…
math.CO2025
Uniform Turán density -- palette classification
Daniel Král', Filip Kučerák, Ander Lamaison +1
In the 1980s, Erdős and Sós initiated the study of Turán hypergraph problems with a uniformity condition on the distribution of edges, i.e., determining density thresholds for the…
math.CO2019
On -chromatic Schrijver graphs: their structure, non--colorability, and critical edges
Gábor Simonyi, Gábor Tardos
We give an elementary proof for the non--colorability of -chromatic Schrijver graphs thus providing such a proof also for -chromatic Kneser graphs. To this end we use a co…