Disjoint edges in geometric graphs
- First Online:
- Cite this article as:
- Alon, N. & Erdös, P. Discrete Comput Geom (1989) 4: 287. doi:10.1007/BF02187731
- 50 Views
Answering an old question in combinatorial geometry, we show that any configuration consisting of a setV ofn points in general position in the plane and a set of 6n − 5 closed straight line segments whose endpoints lie inV, contains three pairwise disjoint line segments.