On the Number of Digons in Arrangements of Pairwise Intersecting Circles

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay

Research output: Contribution to journalArticlepeer-review

Abstract

A long-standing open conjecture of Branko Grünbaum from 1972 states that any simple arrangement of n pairwise intersecting pseudocircles in the plane can have at most 2n-2 digons. Agarwal et al. proved this conjecture for arrangements of pairwise intersecting pseudocircles in which there is a common point surrounded by all pseudocircles. Recently, Felsner, Roch and Scheucher showed that Grünbaum’s conjecture is true for arrangements of pairwise intersecting pseudocircles in which there are three pseudocircles every pair of which create a digon. In this paper we prove this over 50-year-old conjecture of Grünbaum for any simple arrangement of pairwise intersecting circles in the plane.

Original languageAmerican English
Article number30
JournalCombinatorica
Volume45
Issue number3
DOIs
StatePublished - Jun 2025

Keywords

  • Circles
  • Digons
  • Grünbaum
  • Pseudo-circles

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'On the Number of Digons in Arrangements of Pairwise Intersecting Circles'. Together they form a unique fingerprint.

Cite this