Hidde Koerts, Characterizing large clique number in tournaments
A backedge graph of a tournament $T$ with respect to a total ordering $\prec$ of the vertices of $T$ is a graph on $V(T)$ where $uv$ is an edge if and only if $uv \in A(T)$ and $v \prec u$. In 2023, Aboulker, Aubian, Charbit and Lopes introduced the clique number of tournaments based on …