Skip to Main content Skip to Navigation
Journal articles

The Erdős-Sós conjecture for geometric graphs

Abstract : 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 a planar subgraph of G. In this paper we show that ( 1 / 2 )n2 / k-1-n / 2≤f(n,k) ≤2 n(n-2) / k-2. For the case when k=n, we show that 2 ≤f(n,n) ≤3. For the case when k=n and G is a geometric graph on a set of points in convex position, we completely solve the problem and prove that at least three edges must be removed.
Document type :
Journal articles
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 4:28:54 PM
Last modification on : Tuesday, October 19, 2021 - 12:55:35 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:30:11 PM


Files produced by the author(s)




Luis Barba, Ruy Fabila-Monroy, Dolores Lara, Jesús Leaños, Cynthia Rodriguez, et al.. The Erdős-Sós conjecture for geometric graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 1 (1), pp.93--100. ⟨10.46298/dmtcs.628⟩. ⟨hal-00990608⟩



Record views


Files downloads