Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
