2000 character limit reached
Rainbow clique subdivisions
Published 19 Apr 2022 in math.CO | (2204.08804v2)
Abstract: 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 $(\log n){1+o(1)}$ factor of the lower bound. This also implies a result on the rainbow Tur\'{a}n number of cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.