, Volume 17, Issue 3, pp 427–439 | Cite as

Graphs drawn with few crossings per edge

  • János Pach
  • Géza Tóth


We show that if a graph ofv vertices can be drawn in the plane so that every edge crosses at mostk>0 others, then its number of edges cannot exceed 4.108√kv. Fork≤4, we establish a better bound, (k+3)(v−2), which is tight fork=1 and 2. We apply these estimates to improve a result of Ajtai et al. and Leighton, providing a general lower bound for the crossing number of a graph in terms of its number of vertices and edges.

Mathematics Subject Classification (1991)



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Ajtai, V. Chvátal, M. Newborn, andE. Szemerédi: Crossing-free subgraphs,Ann. Discrete Mathematics,12 (1982), 9–12.Google Scholar
  2. [2]
    K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, andE. Welzl: Combinatorial complexity bounds for arrangements of curves and surfaces,Discrete and Computational Geometry,5 (1990), 99–160.Google Scholar
  3. [3]
    G. H. Hardy andE. M. Wright:An Introduction to the Theory of Numbers, University Press, Oxford, 1954.Google Scholar
  4. [4]
    T. Leighton:Complexity Issues in VLSI, Foundations, of Computing Series, MIT Press, Cambridge, MA, 1983.Google Scholar
  5. [5]
    J. Pach andP. K. Agarwal:Combinatorial Geometry, John Wiley, New York, 1995.Google Scholar
  6. [6]
    J. Pach andM. Sharir: On the number of incidences between points and curves,Combinatorics, Probability, and Computing, to appear.Google Scholar
  7. [7]
    J. Spencer: A midrange crossing constant manuscript, 1997.Google Scholar
  8. [8]
    L. Székely: Crossing numbers and hard Erdős problems in discrete geometry,Combinatorics, Probability, and Computing, to appear.Google Scholar
  9. [9]
    E. Szemerédi andW. T. Trotter: Extremal problems in discrete geometry,Combinatorica,3 (1983), 381–392.Google Scholar

Copyright information

© János Bolyai mathematical Society 1997

Authors and Affiliations

  • János Pach
    • 1
  • Géza Tóth
    • 1
  1. 1.Courant InstituteNYU and Hungarian Academy of SciencesHungary

Personalised recommendations