Abstract
Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer n, there is a least integer f(n) such that any tournament whose arcs are coloured with n colours contains a subset of vertices S of size f(n) with the property that any vertex not in S admits a monochromatic path to some vertex of S. In this note we provide a lower bound on the value f(n).
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 callSimilar Papers
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.
