Publications of (and about) Paul Erdös
Autor: Alon, Noga; Erdös, Paul
Title: Disjoint edges in geometric graphs. (In English)
Source: Discrete Comput. Geom. 4, No.4, 287-290 (1989).
Review: Answering an old question in combinatorial geometry, we show that any configuration consisting of a set V of n points in general position in the plane and a set of 6n-5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.
Classif.: * 05C35 Extremal problems (graph theory)
Keywords: combinatorial geometry; configuration; three pairwise disjoint line segments
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag