Subdivisions of a large clique in C6-free graphs

被引:8
作者
Balogh, Jozsef [1 ,2 ]
Liu, Hong [2 ]
Sharifzadeh, Maryam [2 ]
机构
[1] Univ Szeged, Bolyai Inst, H-6720 Szeged, Hungary
[2] Univ Illinois, Dept Math Sci, Urbana, IL 61801 USA
关键词
Subdivisions; Topological minors; Girth; Mader conjecture; Dependent random choice; BIPARTITE GRAPHS; CYCLE;
D O I
10.1016/j.jctb.2014.11.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Mader conjectured that every C-4-free graph has a subdivision of a clique of order linear in its average degree. We show that every C-6-free graph has such a subdivision of a large clique. We also prove the dense case of Mader's conjecture in a stronger sense, i.e., for every c, there is a c' such that every C-4-free graph with average degree cn(1/2) has a subdivision of a clique K-l with l = [c'n(1/2)] where every edge is subdivided exactly 3 times. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:18 / 35
页数:18
相关论文
共 18 条