On edges crossing few other edges in simple topological complete graphs

Citations of this article
Mendeley users who have this article in their library.


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 topological graphT = (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 intersection point of two edges is either a common end-point or a point where the two edges properly cross. A topological graph is simple if any two edges meet in at most one common point. Let h = h (n) be the smallest integer such that every simple topological complete graph on n vertices contains an edge crossing at most h other edges. We show that Ω (n3 / 2) ≤ h (n) ≤ O (n2 / log1 / 4 n). We also show that the analogous function on other surfaces (torus, Klein bottle) grows as c n2. © 2008 Elsevier B.V. All rights reserved.

Author supplied keywords




Kynčl, J., & Valtr, P. (2009). On edges crossing few other edges in simple topological complete graphs. Discrete Mathematics, 309(7), 1917–1923. https://doi.org/10.1016/j.disc.2008.03.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free