Improvement on the decay of crossing numbers

DOI10.1007/s00373-012-1137-3zbMath1267.05068arXiv1201.5421OpenAlexW2761924117MaRDI QIDQ2376099

Jakub Černý, Jan Kynčl, Géza Tóth

Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

crossing numberembedding method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On the Decay of Crossing Numbers of Sparse Graphs

Cites Work

• Minimal graphs with crossing number at least \(k\)
• Improving the crossing lemma by finding more crossings in sparse graphs
• The Moore bound for irregular graphs
• On the decay of crossing numbers
• Improvement on the Decay of Crossing Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvement on the decay of crossing numbers