Showing 2026Show all
2 papers · 1 filter
math.CO2026
Conway's thrackle conjecture: a new upper bound of
Dániel Gábor Simon
A thrackle is a drawing of a graph in the plane in which every pair of edges meets exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that every…
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…