pith. sign in

arxiv: 2002.07248 · v2 · pith:B6O6HZXTnew · submitted 2020-02-17 · 🧮 math.CO

Tournaments and the Strong ErdH{o}s-Hajnal Property

classification 🧮 math.CO
keywords everyvertextournamentconjecturecontainsepsilons-hajnalsubtournament
0
0 comments X
read the original abstract

A conjecture of Alon, Pach and Solymosi, which is equivalent to the celebrated Erd\H{o}s-Hajnal Conjecture, states that for every tournament $S$ there exists $\epsilon(S)>0$ such that if $T$ is an $n$-vertex tournament that does not contains $S$ as a subtournament, then $T$ contains a transitive subtournament on at least $n^{\epsilon(S)}$ vertices. Let $C_5$ 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 $S=C_5$. Here we prove a strengthening of this result, showing that in every tournament $T$ with no subtorunament isomorphic to $C_5$ there exist disjoint vertex subsets $A$ and $B$, each containing a linear proportion of the vertices of $T$, and such that every vertex of $A$ is adjacent to every vertex of $B$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.