On the maximum number of edges in quasi-planar graphs

Eyal Ackerman, G. Tardos

Research output: Contribution to journalArticle

54 Citations (Scopus)

Abstract

A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7 n - O (1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5 n - O (1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.

Original languageEnglish
Pages (from-to)563-571
Number of pages9
JournalJournal of Combinatorial Theory, Series A
Volume114
Issue number3
DOIs
Publication statusPublished - Apr 2007

Fingerprint

Planar graph
Topological Graph
Pairwise
Upper and Lower Bounds
Upper bound
Restriction
Graph in graph theory

Keywords

  • Discharging method
  • Geometric graphs
  • Quasi-planar graphs
  • Topological graphs
  • Turán-type problems

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On the maximum number of edges in quasi-planar graphs. / Ackerman, Eyal; Tardos, G.

In: Journal of Combinatorial Theory, Series A, Vol. 114, No. 3, 04.2007, p. 563-571.

Research output: Contribution to journalArticle

@article{57340764fb084d2eb927db5ca8df7073,
title = "On the maximum number of edges in quasi-planar graphs",
abstract = "A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7 n - O (1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5 n - O (1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.",
keywords = "Discharging method, Geometric graphs, Quasi-planar graphs, Topological graphs, Tur{\'a}n-type problems",
author = "Eyal Ackerman and G. Tardos",
year = "2007",
month = "4",
doi = "10.1016/j.jcta.2006.08.002",
language = "English",
volume = "114",
pages = "563--571",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - On the maximum number of edges in quasi-planar graphs

AU - Ackerman, Eyal

AU - Tardos, G.

PY - 2007/4

Y1 - 2007/4

N2 - A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7 n - O (1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5 n - O (1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.

AB - A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7 n - O (1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5 n - O (1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.

KW - Discharging method

KW - Geometric graphs

KW - Quasi-planar graphs

KW - Topological graphs

KW - Turán-type problems

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

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

U2 - 10.1016/j.jcta.2006.08.002

DO - 10.1016/j.jcta.2006.08.002

M3 - Article

AN - SCOPUS:33846817022

VL - 114

SP - 563

EP - 571

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 3

ER -