### Abstract

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 language | English (US) |
---|---|

Pages (from-to) | 1-9 |

Number of pages | 9 |

Journal | Combinatorica |

Volume | 17 |

Issue number | 1 |

State | Published - 1997 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Combinatorica*,

*17*(1), 1-9.

**Quasi-planar graphs have a linear number of edges.** / Agarwal, Pankaj K.; Aronov, Boris; Pach, János; Pollack, Richard; Sharir, Micha.

Research output: Contribution to journal › Article

*Combinatorica*, vol. 17, no. 1, pp. 1-9.

}

TY - JOUR

T1 - Quasi-planar graphs have a linear number of edges

AU - Agarwal, Pankaj K.

AU - Aronov, Boris

AU - Pach, János

AU - Pollack, Richard

AU - Sharir, Micha

PY - 1997

Y1 - 1997

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0031473639&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031473639&partnerID=8YFLogxK

M3 - Article

VL - 17

SP - 1

EP - 9

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -