2 papers
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.CO2024
The maximum number of digons formed by pairwise crossing pseudocircles
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2
In 1972, Branko Grünbaum conjectured that any arrangement of pairwise crossing pseudocircles in the plane can have at most digons (regions enclosed by exactly two pse…