Improving the crossing lemma by finding more crossings in sparse graphs

DOI10.1145/997817.997831zbMath1376.68112OpenAlexW2065507183MaRDI QIDQ5361656

Géza Tóth, Gábor Tardos, János Pach, Radoš Radoičić

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997831

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (6)

An improvement of the crossing number bound ⋮ The constant of point-line incidence constructions ⋮ On the decay of crossing numbers ⋮ Unnamed Item ⋮ General lower bounds for the minor crossing number of graphs ⋮ Graph minors and the crossing number of graphs

This page was built for publication: Improving the crossing lemma by finding more crossings in sparse graphs