Abstract
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position and edges are represented by straight line segments. We show that a geometric graph on n vertices with no three pairwise disjoint edges has at most 2.5n edges. This result is tight up to an additive constant.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cerny, J. Geometric Graphs with No Three Disjoint Edges. Discrete Comput Geom 34, 679–695 (2005). https://doi.org/10.1007/s00454-005-1191-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-005-1191-1