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 条
12345