2 papers
math.CO2026
Piercing all maximum cliques in hypergraphs
Andreas Holmsen, Attila Jung, Balázs Keszegh +5
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 t…