Crossing tournaments are polynomially $\vec{\chi }$-bounded

Lila Crew, Xinyue Fan, Hidde Koerts +2

Given a tournament $T$, Aboulker, Aubian, Charbit, and Lopes (2023) defined its clique number $\vec{\omega }(T)$ as the minimum clique number of a backedge graph of $T$, and raised the que…