A crossing lemma for multigraphs

DOI10.4230/LIPIcs.SoCG.2018.65zbMath1489.05033arXiv1801.00721MaRDI QIDQ5116525

János Pach, Géza Tóth

Publication date: 18 August 2020

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

zbMATH Keywords

multigraphcrossing numbercrossing lemmaseparator theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Crossings between non-homotopic edges ⋮ The number of crossings in multigraphs with no empty lens ⋮ Crossings Between Non-homotopic Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal problems in discrete geometry
• Improved bounds for planar \(k\)-sets and related problems
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Applications of the crossing number
• The graph crossing number and its variants: a survey
• Crossing Number is NP-Complete
• Complexity of Some Geometric and Topological Problems
• Crossing-Free Subgraphs
• Planar Separators
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry

This page was built for publication: A crossing lemma for multigraphs