Answers are grounded in this paper and cite their sources.
We prove that a properly edge-coloured complete graph K n has a Hamilton circuit with edges of at least n−√2n distinct colours. This is proved with a method inspired by work on long partial transversals in latin squares. Another such method is employed in proving a similar result where the distinct colours all occur on edges not belonging to a given spanning set of edges of K n
No takes yet. Share an insight, caveat, or question.
Lars Andersen (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: