Paper detail

All known prime Erdős-Hajnal tournaments satisfy $ε(H) = Ω(\frac{1}{|H|^{5}\log(|H|)})$

We prove that there exists $C>0$ such that $ε(H) \geq \frac{C}{|H|^{5}\log(|H|)}$, where $ε(H)$ is the Erdős-Hajnal coefficient of the tournament $H$, for every prime tournament $H$ for which the celebrated Erdős-Hajnal Conjecture has been proven so far. This is the first polynomial bound on the EH coefficient obtained for all known prime Erdős-Hajnal tournaments, in particular for infinitely many prime tournaments. As a byproduct of our analysis, we answer affirmatively the question whether there exists an infinite family of prime tournaments $H$ with $ε(H)$ lower-bounded by $\frac{1}{\textit{poly}(|H|)}$, where $\textit{poly}$ is a polynomial function. Furthermore, we give much tighter bounds than those known so far for the EH coefficients of tournaments without large homogeneous sets. This enables us to significantly reduce the gap between best known lower and upper bounds for the EH coefficients of tournaments. As a corollary we prove that every known prime Erdős-Hajnal tournament $H$ satisfies: $-5 + o(1) \leq \frac{\log(ε(H))}{\log(|H|)} \leq -1 + o(1)$. No lower bound on that expression was known before. We also show the applications of those results to the tournament coloring problem. In particular, we prove that for every known prime Erdős-Hajnal tournament $H$ every $H$-free tournament has \textit{chromatic number} at most $O(n^{1-\frac{C}{|H|^{5}\log(|H|)}}\log(n))$, where $C>0$ is some universal constant. The related coloring can be constructed algorithmically in the quasipolynomial time by following straightforwadly the proof of our main result. In comparison, the standard Ramsey theory gives only $O(\frac{n}{\log(n)})$ bounds for the tournament chromatic number.