Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

COMPGEOM
2006
ACM

favoriteEmaildiscussreport

107views Discrete Geometry» more COMPGEOM 2006»

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

14 years 1 months ago

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

Download page.mi.fu-berlin.de

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

Eyal Ackerman

Real-time Traffic

COMPGEOM 2006 | Maximum Number | Pairwise Crossing Edges | Topological Graph |

claim paper

Related Content

» On the maximum number of edges in quasiplanar graphs

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» On Graph Crossing Number and Edge Planarization

» Adding one edge to planar graphs makes crossing number hard

» On the Maximum Number of Cliques in a Graph

» On grids in topological graphs

» EdgeRemoval and NonCrossing Configurations in Geometric Graphs

» The independence number in graphs of maximum degree three

» Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem

Post Info
More Details (n/a)

Added	13 Jun 2010
Updated	13 Jun 2010
Type	Conference
Year	2006
Where	COMPGEOM
Authors	Eyal Ackerman

Comments (0)