Seonghyuk Im (임성혁), Large clique subdivisions in graphs without small dense subgraphs
Seonghyuk Im (임성혁), Large clique subdivisions in graphs without small dense subgraphs
What is the largest number $f(d)$ where every graph with average degree at least $d$ contains a subdivision of $K_{f(d)}$? Mader asked this question in 1967 and $f(d) = \Theta(\sqrt{d})$ was proved by Bollobás and Thomason and independently by Komlós and Szemerédi. This is best possible by considering a disjoint union of $K_{d,d}$. However, this …