On the maximum number of edges in topological graphs with no four pairwise crossing edges

Eyal Ackerman

doi:10.1007/s00454-009-9143-9

On the maximum number of edges in topological graphs with no four pairwise crossing edges

Research output: Contribution to journal › Article › peer-review

Abstract

A topological graph is called k -quasi-planar if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). We provide an affirmative answer to the case k=4.

Original language	English
Pages (from-to)	365-375
Number of pages	11
Journal	Discrete and Computational Geometry
Volume	41
Issue number	3
DOIs	https://doi.org/10.1007/s00454-009-9143-9
State	Published - Apr 2009
Externally published	Yes

Keywords

Discharging method
Geometric graphs
Quasi-planar graphs
Topological graphs

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/s00454-009-9143-9

Cite this

@article{f75608af7a1e4a6f8e43dcadd88a1502,

title = "On the maximum number of edges in topological graphs with no four pairwise crossing edges",

abstract = "A topological graph is called k -quasi-planar if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). We provide an affirmative answer to the case k=4.",

keywords = "Discharging method, Geometric graphs, Quasi-planar graphs, Topological graphs",

author = "Eyal Ackerman",

year = "2009",

month = apr,

doi = "10.1007/s00454-009-9143-9",

language = "English",

volume = "41",

pages = "365--375",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - On the maximum number of edges in topological graphs with no four pairwise crossing edges

AU - Ackerman, Eyal

PY - 2009/4

Y1 - 2009/4

N2 - A topological graph is called k -quasi-planar if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). We provide an affirmative answer to the case k=4.

AB - A topological graph is called k -quasi-planar if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). We provide an affirmative answer to the case k=4.

KW - Discharging method

KW - Geometric graphs

KW - Quasi-planar graphs

KW - Topological graphs

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

U2 - 10.1007/s00454-009-9143-9

DO - 10.1007/s00454-009-9143-9

M3 - Article

AN - SCOPUS:62249196027

SN - 0179-5376

VL - 41

SP - 365

EP - 375

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 3

ER -

On the maximum number of edges in topological graphs with no four pairwise crossing edges

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this