On the number of edges of separated multigraphs

DOI10.1007/978-3-030-92931-2_16OpenAlexW4205497438MaRDI QIDQ2151445

Andrew Suk, Jacob Fox, János Pach

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2108.11290

zbMATH Keywords

lensesmultigraphscrossing lemma

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• On the Erdős distinct distances problem in the plane
• The number of crossings in multigraphs with no empty lens
• A crossing lemma for multigraphs
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Crossings Between Non-homotopic Edges
• Toward a theory of crossing numbers

This page was built for publication: On the number of edges of separated multigraphs