2 papers
math.CO2024
The complexity of recognizing -free hypergraphs
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi +1
The study of geometric hypergraphs gave rise to the notion of -free hypergraphs. A hypergraph is called -free if there is an ordering of its vertices such…
math.CO2024
On the number of digons in arrangements of pairwise intersecting circles
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2
A long-standing open conjecture of Branko Grünbaum from 1972 states that any simple arrangement of pairwise intersecting pseudocircles in the plane can have at most digo…