The Erdos-Sos Conjecture for Geometric Graphs

被引：0

作者：

Barba, Luis ^{[1
,2
]}

Fabila-Monroy, Ruy ^{[3
]}

Lara, Dolores ^{[4
]}

Leanos, Jesus ^{[5
]}

Rodriguez, Cynthia ^{[6
,7
]}

Salazar, Gelasio ^{[8
]}

Zaragoza, Francisco J. ^{[6
]}

机构：

[1] ULB, FNRS, Boursier FRIA, Dept Informat, Brussels, Belgium

[2] Carleton Univ, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada

[3] CINVESTAV, Dept Matemat, Mexico City, DF, Mexico

[4] Univ Politecn Cataluna, Dept Matemat Aplicada 2, Barcelona, Spain

[5] UAZ Mexico, Unidad Acad Matemat, Mexico City, DF, Mexico

[6] UAM Azcapotzalco, Dept Sistemas, Mexico City, DF, Mexico

[7] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada

[8] UASLP, Inst Fis, Mexico City, DF, Mexico

来源：

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | 2013年 / 15卷 / 01期

关键词：

extremal graph theory; geometric graph; spanning tree;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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) n(2)/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.

引用

页码：93 / 100

页数：8

共 50 条

[1] The Erdos-Sos conjecture for graphs of girth 5
Brandt, S
Dobson, E
[J]. DISCRETE MATHEMATICS, 1996, 150 (1-3) : 411 - 414
[2] On the Erdos-Sos conjecture
Wozniak, M
[J]. JOURNAL OF GRAPH THEORY, 1996, 21 (02) : 229 - 234
[3] A NOTE ON THE ERDOS-SOS CONJECTURE
ZHOU, B
[J]. ACTA MATHEMATICA SCIENTIA, 1984, 4 (03) : 287 - 289
[4] A variant of the Erdos-Sos conjecture
Havet, Frederic
Reed, Bruce
Stein, Maya
Wood, David R.
[J]. JOURNAL OF GRAPH THEORY, 2020, 94 (01) : 131 - 158
[5] On the Erdos-Sos Conjecture and graphs with large minimum degree
Eaton, Nancy
Tiner, Gary
[J]. ARS COMBINATORIA, 2010, 95 : 373 - 382
[6] The Erdos-Sos conjecture for spiders
Fan, Genghua
Sun, Lingli
[J]. DISCRETE MATHEMATICS, 2007, 307 (23) : 3055 - 3062
[7] The Erdos-Sos conjecture for graphs without C-4
Sacle, JF
Wozniak, M
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 70 (02) : 367 - 372
[8] On the Erdos-Sos Conjecture for Graphs with Circumference at Most k+1
Heissan, A. M.
Tiner, Gary
[J]. COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2020, 2022, 388 : 229 - 243
[9] A LOCAL APPROACH TO THE ERDOS-SOS CONJECTURE
Rozhon, Vaclav
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (02) : 643 - 664
[10] The Erdos-Sos conjecture for spiders of diameter 9
Sun, Lingli
[J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2007, 39 : 27 - 37

← 1 2 3 4 5 →