Session I.3 - Graph Theory and Combinatorics
Poster
Rainbow Clique Subdivisions
Yan Wang
Shanghai Jiao Tong University, China - This email address is being protected from spambots. You need JavaScript enabled to view it.
In this talk, we show that for any integer $t \ge 2$, every properly edge colored $n$-vertex graph with average degree at least $(\log n)^{2+o(1)}$ contains a rainbow subdivision of a complete graph of size $t$. Note that this bound is within a log factor of the lower bound. This also implies a result on the rainbow Turán number of cycles.