Abstract

For every positive integer r there exists a constant C r depending only on r such that for every colouring of the edges of the complete bipartite graph K n , n with r colours, there exists a set of at most C r monochromatic cycles whose vertex sets partition the vertex set of K n , n . This answers a question raised by Erdős, Gyárfás, and Pyber.

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 call

Disclaimer: 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.