The Erdős-Sós Conjecture for Geometric Graphs

Luis F. Barba, Ruy Fabila-Monroy, Dolores Lara +4

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer…