In extremal graph theory, one big question is finding a condition of the number of edges that guarantees the existence of a particular substructure in a graph. In the first half of this talk, I'll talk about the history of such problems, especially focusing on clique subdivisions. In the last half of the talk, I'll introduce my recent result with Jaehoon Kim, Younjin Kim, and Hong Liu, which states that if a graph G has no dense small subgraph, then G has a clique subdivision of size almost linear in its average degree and discuss some applications and further open questions.
|