A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position, the edges are represented by straight line segments connecting the corresponding points. We show that a geometric graph of n vertices with no k + 1 pairwise disjoint edges has at most 2 9 k 2 n edges.doi:10.1006/jcta.1999.3001 fatcat:jidzw242hnejtjciz5dr7wgs5y