Abstract
Let T be a Hamiltonian multipartite tournament with n vertices and γ a Hamiltonian cycle of T. We prove that for every k ,4 ≤ k ≤ n+4 , there exists a cycle C of length l(C) ∈{ k − 3 ,k − 2 ,k − 1 ,k }, whose intersection with the arcs of γ is at least l(C) − 3. In some cases the result is best possible.
Sign-in/Register to access full text options 
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.
