Combinatorica

, Volume 17, Issue 1, pp 1–9

Quasi-planar graphs have a linear number of edges

Authors

  • Pankaj K. Agarwal
    • Department of Computer ScienceDuke University
  • Boris Aronov
    • Computer and Information Science DepartmentPolytechnic University
  • János Pach
    • Department of Computer Science, City CollegeCUNY
    • Courant Institute of Mathematical SciencesNew York University
    • Hungarian Academy of Sciences
  • Richard Pollack
    • Courant Institute of Mathematical SciencesNew York University
  • Micha Sharir
    • Courant Institute of Mathematical SciencesNew York University
    • School of Mathematical SciencesTel Aviv University
Article

DOI: 10.1007/BF01196127

Cite this article as:
Agarwal, P.K., Aronov, B., Pach, J. et al. Combinatorica (1997) 17: 1. doi:10.1007/BF01196127

Abstract

A graph is calledquasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph withn vertices isO(n).

Mathematics Subject Classification (1991)

05 C 3505 C 4068 R 05

Copyright information

© János Bolyai Mathematical Society 1997