Prefer a chat interface with context about you and your work?
Hamilton circuits with many colours in properly edge-coloured complete graphs.
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 …