Candida BowtellPatrick MorrisYanitsa PehovaKatherine Staden
所有作者
Candida BowtellPatrick MorrisYanitsa PehovaKatherine Staden
文献摘要
Let G={G1,…,Gm} be a graph collection on a common vertex set V of size n such that δ(Gi)≥(1+o(1))n/2 for every i∈[m]. We show that G contains every Hamilton cycle pattern. That is, for every map χ:[n]→[m] there is a Hamilton cycle whose i-th edge lies in Gχ(i).