Colourful Hamilton cycle packing conjecture for Dirac graphs
Let satisfy , let be an -vertex graph with minimum degree , and suppose the edges of are properly edge-coloured. Colourful Hamilton cycle packing conjecture. The graph contains at least Hamilton cycles, each using at least distinct colours. The conjecture is motivated by results on edge-disjoint Hamilton cycle packings in uncoloured graphs; the supplied text gives no resolution evidence, so it remains open.
References
- Xinbu Cheng, Xinqi Huang, Hong Liu, Bin Wang and Zhifei Yan, “Colour diversity in spanning structures under Dirac-type conditions”, arXiv:2602.23801 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.