Chi-boundedness conjecture for poset tournaments
A poset tournament is a tournament for which there exists a total ordering of such that, for all , if and , then . Equivalently, the forward edges with respect to form a poset. Poset-tournament chi-boundedness conjecture. The class of poset tournaments is -bounded. Poset tournaments were introduced in earlier work, where they were conjectured to characterize tournaments whose -free subclasses have bounded domination number. Whether all poset tournaments are -bounded remains open.
References
- Pierre Aboulker, Logan Crew, Julien Duron, Xinyue Fan, Hugo Jacob, Rémy Kimbrough, Hidde Koerts, Benjamin Moore, Sophie Spirkl and Stéphan Thomassé, “Decomposing tournaments into comparability graphs”, arXiv:2606.07748 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.