Abstract
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges is at most 2n−2. We also give a strengthening of this result in the case where G does not contain a cycle of length 4. In the latter case we show that G has at most 3/2(n−1) edges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Cairns and Y. Nikolayevsky: Bounds for generalized thrackles, Discrete Comput. Geom. 23(2) (2000), 191–206.
M. Katchalski and H. Last: On geometric graphs with no two edges in convex position, Discrete Comput. Geom. 19(3) (Special Issue) (1998), 399–404.
Y. Kupitz: On pairs of disjoint segments in convex position in the plane, Ann. Discrete Math. 20 (1984), 203–208.
L. Lovász, J. Pach and M. Szegedy: On Conway’s thrackle conjecture, Discrete Comput. Geom. 18(4) (1997), 369–376.
J. Pach: Geometric graph theory, Chapter 10 in J. E. Goodman and J. O’Rourke: Handbook of Discrete and Computational Geometry, 2nd ed., CRC Press, 2004, pp. 219–238.
P. Valtr: On geometric graphs with no k pairwise parallel edges, Discrete Comput. Geom. 19(3) (Special Issue) (1998), 461–469.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pinchasi, R. Geometric graphs with no two parallel edges. Combinatorica 28, 127–130 (2008). https://doi.org/10.1007/s00493-008-2250-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-008-2250-z