Abstract
Let H be a tournament, and let ϵ≥0 be a real number. We call ϵ an “Erdős–Hajnal coefficient” for H if there exists c>0 such that in every tournament G not containing H as a subtournament, there is a transitive subset of cardinality at least c|V(G)|ϵ. The Erdős–Hajnal conjecture asserts, in one form, that every tournament H has a positive Erdős–Hajnal coefficient. This remains open, but recently the tournaments with Erdős–Hajnal coefficient 1 were completely characterized. In this paper we provide an analogous theorem for tournaments that have an Erdős–Hajnal coefficient larger than 5/6; we give a construction for them all, and we prove that for any such tournament H there are numbers c,d such that, if a tournament G with |V(G)|>1 does not contain H as a subtournament, then V(G) can be partitioned into at most c(log(|V(G)|))d transitive subsets.
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.
