论文标题
在完整图的适当边缘着色的颜色同构对上
On Color Isomorphic Pairs in Proper Edge Colourings of Complete Graphs
论文作者
论文摘要
在最近的论文开始了针对完整图的颜色同构问题的研究之后，我们为$ f_2（n，h）$的上限获得了$ h $ h $的$ h $，作为$ k_0 $ h $的$ k_0 $ th固定树的根源，用于一些足够大的$ k_0 $。证明使用BUKH的随机多项式方法。我们还获得了完整双方图的$ 1 $ subdivisions的匹配下限。
Following the recent paper which initiated the study of colour isomorphism problems for complete graphs, we obtain upper bounds for $f_2(n,H)$ for a family of graphs $H$ obtained as the $K_0$-th rooted power of a balanced rooted tree for some sufficiently large $K_0$. The proof uses the random polynomial method of Bukh. We also obtain matching lower bounds for $1$-subdivisions of the complete bipartite graph.
