Geometric Graphs with No Self-intersecting Path of Length Three

Authors:
János Pach;Rom Pinchasi;Gábor Tardos;Géza Tóth
Affiliations:
-;-;-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 2
Cited 4

Davenport-Schnizel theory of matrices

Discrete Mathematics
Extremal Graph Theory

Extremal Graph Theory

Topological graphs with no self-intersecting cycle of length 4

Proceedings of the nineteenth annual symposium on Computational geometry
On locally Delaunay geometric graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Noncrossing Hamiltonian paths in geometric graphs

Discrete Applied Mathematics
Crossing stars in topological graphs

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a geometric graph with n vertices, i.e., a graph drawn in the plane with straight-line edges. It is shown that if G has no self-intersecting path of length 3, then its number of edges is O(n log n). This result is asymptotically tight. Analogous questions for curvilinear drawings and for longer paths are also considered.