A conjecture of Alon, Pach and Solymosi, which is equivalent to the celebrated Erd\H{o}s-Hajnal Conjecture, states that for every tournament there exists such that if is an -vertex tournament that does not contains as a subtournament, then contains a transitive subtournament on at least vertices. Let be the unique five-vertex tournament where every vertex has two inneighbors and two outneighbors. The Alon-Pach-Solymosi conjecture is known to be true for the case when . Here we prove a strengthening of this result, showing that in every tournament with no subtorunament isomorphic to there exist disjoint vertex subsets and , each containing a linear proportion of the vertices of , and such that every vertex of is adjacent to every vertex of .

生成讲解博客的中文版本

生成AI智能校验的中文版本