Disjoint edges in geometric graphs

N. Alon, P. Erdös

Research output: Contribution to journalArticlepeer-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 6 n - 5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.

Original languageEnglish
Pages (from-to)287-290
Number of pages4
JournalDiscrete and Computational Geometry
Issue number1
StatePublished - Dec 1989


Dive into the research topics of 'Disjoint edges in geometric graphs'. Together they form a unique fingerprint.

Cite this