, Volume 4, Issue 1, pp 287-290

Disjoint edges in geometric graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Research supported in part by an Allon Fellowship and by a Bat Sheva de-Rothschild grant.