Limiting Crossing Numbers for Geodesic Drawings on the Sphere

DOI10.1007/978-3-030-68766-3_27OpenAlexW3134791307MaRDI QIDQ5014128

Alexandra Wesolek, Marthe Bonamy, Bojan Mohar

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

crossing numbergraph limitstriangle densityrandom drawinggeodesic drawing

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
• Unnamed Item
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Generalized quasirandom graphs
• Graph Theory
• From the Buffon Needle Problem to the Kreiss Matrix Theorem
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Crossing Numbers of Graphs
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
• On the Distribution of Crossings in Random Complete Graphs
• On a problem of P. Turan concerning graphs

This page was built for publication: Limiting Crossing Numbers for Geodesic Drawings on the Sphere