Disjoint edges in geometric graphs
- 81 Downloads
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.
KeywordsGeneral Position Pairwise Disjoint Discrete Comput Geom Straight Line Segment Geometric Graph
- [AA]J. Akiyama and N. Alon, Disjoint simplices and geometric hypergraphs,Proc. 3rd New York Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences, to appear.Google Scholar
- [AH]S. Avital and H. Hanani, Graphs,Gilyonot Lematematika 3(2) (1966), 2–8 (in Hebrew).Google Scholar
- [Pe]M. A. Perles, Unpublished notes.Google Scholar