On edges crossing few other edges in simple topological complete graphs

Kynčl, Jan and Valtr, Pavel (2006) On edges crossing few other edges in simple topological complete graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 274-284(Official URL: http://dx.doi.org/10.1007/11618058_25).

Full text not available from this repository.


We study the existence of edges having few crossings with the other edges in drawings of the complete graph (more precisely, in simple topological complete graphs). A {em topological graph} T=(V,E) is a graph drawn in the plane with vertices represented by distinct points and edges represented by Jordan curves connecting the corresponding pairs of points (vertices), passing through no other vertices, and having the property that any intersetion point of two edges is either a common end-point or a point where the two edges properly cross. A topological graph is {em simple}, if any two edges meet in at most one common point. Let h=h(n) be the smallest integer such that every simple complete topological graph on n vertices contains an edge crossing at most h other edges. We show that Omega(n^{3/2})le h(n) le O(n^2/log^{1/4}n). We also show that the analogous function on other surfaces (torus, Klein bottle) grows as cn^2.

Item Type: Conference Paper
Additional Information: 10.1007/11618058_25
Classifications: G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/697

Actions (login required)

View Item View Item