$P_{k}$-freeness implies small dichromatic number

TL;DR

This paper introduces a quadratic time combinatorial algorithm that finds large transitive subsets in $P_k$-free tournaments, leading to improved approximations for acyclic coloring and tight bounds related to Erdős-Hajnal coefficients.

Contribution

It presents the first quadratic time algorithm for large transitive subsets in $P_k$-free tournaments and derives tight bounds on their size and related coloring problems.

Findings

Existence of large transitive subsets of size $n^{c/(k ext{log}(k)^2)}$

Subcubic approximation algorithm for acyclic coloring in $P_k$-free tournaments

Tight bounds on maximum transitive subset size in $P_k$-free tournaments

Abstract

We propose a purely combinatorial quadratic time algorithm that for any $n$-vertex $P_{k}$-free tournament $T$, where $P_{k}$ is a directed path of length $k$, finds in $T$ a transitive subset of order $n^{\frac{c}{k\log(k)^{2}}}$. As a byproduct of our method, we obtain subcubic $O(n^{1-\frac{c}{k\log(k)^{2}}})$-approximation algorithm for the optimal acyclic coloring problem on $P_{k}$-free tournaments. Our results are tight up to the $\log(k)$-factor in the following sense: there exist infinite families of $P_{k}$-free tournaments with largest transitive subsets of order at most $n^{\frac{c\log(k)}{k}}$. As a corollary, we give tight asymptotic results regarding the so-called \textit{Erd\H{o}s-Hajnal coefficients} of directed paths. These are some of the first asymptotic results on these coefficients for infinite families of prime graphs.