Induced subdivisions in Ks,s-free graphs of large average degree

被引：37

作者：

Kühn, D

Osthus, D

机构：

[1] Free Univ Berlin, Math Inst, D-14195 Berlin, Germany

[2] Humboldt Univ, Dept Informat, D-10099 Berlin, Germany

来源：

COMBINATORICA | 2004年 / 24卷 / 02期

关键词：

D O I：

10.1007/s00493-004-0017-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a K-s,K-s as a subgraph or an induced subdivision of H.

引用

页码：287 / 304

页数：18

共 50 条

[31] Large 2P(3)-free graphs with bounded degree
Chung, MS
West, DB
DISCRETE MATHEMATICS, 1996, 150 (1-3) : 69 - 79
[32] On the chromatic number of triangle-free graphs of large minimum degree
Thomassen, C
COMBINATORICA, 2002, 22 (04) : 591 - 596
[33] On the chromatic number of pentagon-free graphs of large minimum degree
Thomassen, Carsten
COMBINATORICA, 2007, 27 (02) : 241 - 243
[34] PROPER CONFLICT-FREE COLORING OF GRAPHS WITH LARGE MAXIMUM DEGREE
Cranston, Daniel W.
Liu, Chun-Hung
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (04) : 3004 - 3027
[35] On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree
Carsten Thomassen
Combinatorica, 2002, 22 : 591 - 596
[36] Large 2P3-free graphs with bounded degree
Discrete Math, 1-3 (69-79):
[37] On the Chromatic Number of H-Free Graphs of Large Minimum Degree
Lyle, Jeremy
GRAPHS AND COMBINATORICS, 2011, 27 (05) : 741 - 754
[38] On the Chromatic Number of H-Free Graphs of Large Minimum Degree
Jeremy Lyle
Graphs and Combinatorics, 2011, 27 : 741 - 754
[39] Tuza's Conjecture for graphs with maximum average degree less than 7
Puleo, Gregory J.
EUROPEAN JOURNAL OF COMBINATORICS, 2015, 49 : 134 - 152
[40] Large induced trees in Kr-free graphs
Fox, Jacob
Loh, Po-Shen
Sudakov, Benny
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (02) : 494 - 501

← 1 2 3 4 5 →