The maximum number of digons formed by pairwise intersecting pseudocircles

DOI10.4230/LIPICS.SOCG.2025.2MaRDI QIDQ7312640zbMATH OpenFDO

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

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2025.2

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A note on lenses in arrangements of pairwise intersecting circles in the plane
• Arrangements of pseudocircles: triangles and drawings
• Bounds for generalized thrackles
• Enumeration of projective-planar embeddings of graphs
• Gallai-Sylvester theorem for pairwise intersecting unit circles
• Geometric graphs with no two parallel edges
• scientific article; zbMATH DE number 2145243 (Why is no real title available?)
• scientific article; zbMATH DE number 3394958 (Why is no real title available?)
• Intersection reverse sequences and geometric applications.
• Lenses in arrangements of pseudo-circles and their applications
• On geometric graphs with no k pairwise parallel edges
• On geometric graphs with no two edges in convex position
• On Sets of Distances of n Points
• On the complexity of arrangements of circles in the plane
• On the number of digons in arrangements of pairwise intersecting circles
• On the number of digons in arrangements of pairwise intersecting circles
• Projective-planar graphs with even duals
• Superthrackles
• Toward a theory of crossing numbers

This page was built for publication: The maximum number of digons formed by pairwise intersecting pseudocircles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312640)