Crossings between non-homotopic edges

DOI10.1016/j.jctb.2022.05.007zbMath1490.05189OpenAlexW3037442767MaRDI QIDQ2673492

Gábor Tardos, János Pach, Géza Tóth

Publication date: 10 June 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2022.05.007

zbMATH Keywords

crossing numbergraph drawinghomotopic edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the crossing lemma by finding more crossings in sparse graphs
• Graphs drawn with few crossings per edge
• Improved bounds for planar \(k\)-sets and related problems
• A successful concept for measuring non-planarity of graphs: The crossing number.
• The number of crossings in multigraphs with no empty lens
• Systems of curves on surfaces
• The graph crossing number and its variants: a survey
• On topological graphs with at most four crossings per edge
• Cutting algebraic curves into pseudo-segments and applications
• Distinct distances in homogeneous sets in Euclidean space
• Crossing Number is NP-Complete
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Number of Incidences Between Points and Curves
• Crossing Numbers of Graphs
• Counting curve types
• Crossings Between Non-homotopic Edges
• A crossing lemma for multigraphs