On color isomorphic subdivisions |
| |
Institution: | School of Mathematical Sciences, Capital Normal University, Beijing 100048, China |
| |
Abstract: | Given a graph H and an integer , let be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that where is the 1-subdivision of the complete graph . This answers a question of Conlon and Tyomkyn (2021) 4]. |
| |
Keywords: | Color isomorphic Subdivision Edge-coloring |
本文献已被 ScienceDirect 等数据库收录! |
|