Pure pairs. X. Tournaments and the strong Erdos-Hajnal property
Maria Chudnovsky, Alex Scott, Paul Seymour, Sophie Spirkl

TL;DR
This paper investigates which tournaments guarantee large pure pairs in larger tournaments avoiding a certain subtournament, advancing understanding of the strong Erdős–Hajnal property for small and specific tournaments.
Contribution
It establishes that tournaments with at most three backedges have the strong EH-property, and identifies exceptions among small tournaments, extending previous results.
Findings
Tournaments with at most three backedges have the strong EH-property.
Most small tournaments up to six vertices have the property, with a few exceptions.
A specific seven-vertex tournament does not have the strong EH-property.
Abstract
A pure pair in a tournament is an ordered pair of disjoint subsets of such that every vertex in is adjacent from every vertex in . Which tournaments have the property that if is a tournament not containing as a subtournament, and , there is a pure pair in with , where is a constant independent of ? Let us say that such a tournament has the strong EH-property. As far as we know, it might be that a tournament has this property if and only if its vertex set has a linear ordering in which its backedges form a forest. Certainly this condition is necessary, but we are far from proving sufficiency. We make a small step in this direction, showing that if a tournament can be ordered with at most three backedges then it has the strong EH-property (except for one case, that we could not decide). In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
