The Erdős-Sós conjecture for geometric graphs - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

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.
Fichier principal
Vignette du fichier
2196-7736-1-PB.pdf (269.49 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00990608 , version 1 (13-05-2014)

Identifiers

Cite

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, 2013, Vol. 15 no. 1 (1), pp.93--100. ⟨10.46298/dmtcs.628⟩. ⟨hal-00990608⟩

Collections

TDS-MACS
358 View
1622 Download

Altmetric

Share

More