A proof of Mader's conjecture on large clique subdivisions in $C_4$-free graphs

Abstract

Given any integers $s,t\ge 2$, we show there exists some $c=c(s,t)>0$ such that any $K_{s,t}$-free graph with average degree $d$ contains a subdivision of a clique with at least $c{d}^{\frac{1}{2}\frac{s}{s-1}}$ vertices. In particular, when $s=2$ this resolves in a strong sense the conjecture of Mader in 1999 that every $C_4$-free graph has a subdivision of a clique with order linear in the average degree of the original graph. In general, the widely conjectured asymptotic behaviour of the extremal density of $K_{s,t}$-free graphs suggests our result is tight up to the constant $c(s,t)$.

25 pages, 1 figure

References in corpus (1)

• Logarithmically-small Minors and Topological Minors

Cited by in corpus (4)

• Proof of Komlós's conjecture on Hamiltonian subsets
• Extremal density for sparse minors and subdivisions
• Ramsey numbers of cycles versus general graphs
• Well-mixing vertices and almost expanders