The maximum number of digons formed by pairwise crossing pseudocircles
Preprint
Abstract
In 1972, Branko Grünbaum conjectured that any arrangement of $n>2$ pairwise crossing pseudocircles in the plane can have at most $2n-2$ digons (regions enclosed by exactly two pseudoarcs), with the bound being tight. While this conjecture has been confirmed for cylindrical arrangements of pseudocircles and more recently for geometric circles, we extend these results to any simple arrangement of pairwise intersecting pseudocircles. Using techniques from the above-mentioned special cases, we provide a complete proof of Grünbaum's conjecture that has stood open for over five decades.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On the Number of Digons in Arrangements of Pairwise Intersecting CirclesCombinatorica, 2025
- Arrangements of Pseudocircles: Triangles and DrawingsDiscrete & Computational Geometry, 2020
- Geometric graphs with no two parallel edgesCombinatorica, 2008
- Intersection reverse sequences and geometric applicationsJournal of Combinatorial Theory, Series A, 2006
- Gallai—Sylvester Theorem for Pairwise Intersecting Unit CirclesDiscrete & Computational Geometry, 2002
- On the Complexity of Arrangements of Circles in the PlaneDiscrete & Computational Geometry, 2001
- On Geometric Graphs with No Two Edges in Convex PositionDiscrete & Computational Geometry, 1998
- On Geometric Graphs with No k Pairwise Parallel EdgesDiscrete & Computational Geometry, 1998
- Projective‐planar graphs with even dualsJournal of Graph Theory, 1992
- Toward a theory of crossing numbersJournal of Combinatorial Theory, 1970