Crossing numbers of imbalanced graphs

DOI10.1002/JGT.20435MaRDI QIDQ3055901zbMATH OpenOpenAlexFDO

Authors János Pach, Gábor Tardos, József Solymosi

Publication date 10 November 2010

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20435

zbMATH Keywords

crossing numbergeometric graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Improving the crossing lemma by finding more crossings in sparse graphs
• Improving the crossing lemma by finding more crossings in sparse graphs
• An improvement of the crossing number bound
• Graphs drawn with few crossings per edge
• On topological graphs with at most four crossings per edge

Cites work

• Crossing Number is NP-Complete
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Distinct distances in the plane
• Graphs drawn with few crossings per edge
• Halving point sets
• Improved bounds for planar k-sets and related problems
• Isosceles triangles determined by a planar point set
• New bounds on crossing numbers
• On the Number of Incidences Between Points and Curves
• The k most frequent distances in the plane

Cited in

(5)

• Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
• scientific article; zbMATH DE number 2084269 (Why is no real title available?)
• Sumsets of semiconvex sets
• An improvement of the crossing number bound
• Improving the crossing lemma by finding more crossings in sparse graphs

This page was built for publication: Crossing numbers of imbalanced graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055901)