Quasi-planar graphs have a linear number of edges

Pankaj K. Agarwal*, Boris Aronov, János Pach, Richard Pollack, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


A graph is called quasi-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 with n vertices is O(n).

Original languageEnglish
Pages (from-to)1-9
Number of pages9
Issue number1
StatePublished - 1997


Dive into the research topics of 'Quasi-planar graphs have a linear number of edges'. Together they form a unique fingerprint.

Cite this