### Seonghyuk Im (임성혁), Large clique subdivisions in graphs without small dense subgraphs

Room B232 IBS (기초과학연구원)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})$ …