A

**Problem:** *Find the largest number of edges in a geometric graph
with* n *vertices that does not have 3 disjoint edges.*

Constructions of geometric graphs with *n* vertices and *5n/2
+ O(1)* edges are known. The best known upper bound on the number of
edges in a geometric graph is *3n*.

I do not have references for this problem.

Send comments to *dan.archdeacon@uvm.edu*

December 2003