Abstract
Given a graph H and an integer k⩾2, let fk(n,H) be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph Kn with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that f2(n,Ht)=Ω(n1+12t−3) where Ht is the 1-subdivision of the complete graph Kt. This answers a question of Conlon and Tyomkyn (2021) [4].
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call