Quasi-planar graphs have a linear number of edges

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

    Research output: Contribution to journalArticle

    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 languageEnglish (US)
    Pages (from-to)1-9
    Number of pages9
    JournalCombinatorica
    Volume17
    Issue number1
    StatePublished - 1997

    Fingerprint

    Planar graph
    Pairwise
    Graph in graph theory

    ASJC Scopus subject areas

    • Mathematics(all)
    • Discrete Mathematics and Combinatorics

    Cite this

    Agarwal, P. K., Aronov, B., Pach, J., Pollack, R., & Sharir, M. (1997). Quasi-planar graphs have a linear number of edges. 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.

    In: Combinatorica, Vol. 17, No. 1, 1997, p. 1-9.

    Research output: Contribution to journalArticle

    Agarwal, PK, Aronov, B, Pach, J, Pollack, R & Sharir, M 1997, 'Quasi-planar graphs have a linear number of edges', Combinatorica, vol. 17, no. 1, pp. 1-9.
    Agarwal PK, Aronov B, Pach J, Pollack R, Sharir M. Quasi-planar graphs have a linear number of edges. Combinatorica. 1997;17(1):1-9.
    Agarwal, Pankaj K. ; Aronov, Boris ; Pach, János ; Pollack, Richard ; Sharir, Micha. / Quasi-planar graphs have a linear number of edges. In: Combinatorica. 1997 ; Vol. 17, No. 1. pp. 1-9.
    @article{b7a37abd6d0344ec906fbd6b5a60b23a,
    title = "Quasi-planar graphs have a linear number of edges",
    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).",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and J{\'a}nos Pach and Richard Pollack and Micha Sharir",
    year = "1997",
    language = "English (US)",
    volume = "17",
    pages = "1--9",
    journal = "Combinatorica",
    issn = "0209-9683",
    publisher = "Janos Bolyai Mathematical Society",
    number = "1",

    }

    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 -