Discrete & Computational Geometry

, Volume 4, Issue 4, pp 287-290

First online:

Disjoint edges in geometric graphs

  • N. AlonAffiliated withDepartment of Mathematics, Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat Aviv
  • , P. ErdösAffiliated withMathematical Institute of the Hungarian Academy of Sciences

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.