Showing math.COShow all
2 papers · 1 filter
math.CO2025
Coloring Geometric Hypergraphs: A Survey
Gábor Damásdi, Balázs Keszegh, János Pach +2
The \emph{chromatic number} of a hypergraph is the smallest number of colors needed to color the vertices such that no edge of at least two vertices is monochromatic. Given a famil…
math.CO2025
Generalizations of the Crossing Lemma
Geza Toth
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound o…