On color isomorphic subdivisions

Abstract

Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $C$ such that there exists a proper edge-coloring of the complete graph $K_{n}$ with $C$ colors containing no $k$ vertex-disjoint color isomorphic copies of $H$. In this paper, we prove that $f_{2}(n,H_{t})=\Omega(n^{1+\frac{1}{2t-3}})$ where $H_{t}$ is the $1$-subdivision of the complete graph $K_{t}$. This answers a question of Conlon and Tyomkyn (arXiv: 2002.00921).