Aubian–Charbit–Lopes substitution conjecture for polynomially dichromatic-bounded tournaments
Let be a class of tournaments, where a tournament is an orientation of a complete graph. Let denote the closure of under substitution. Aubian–Charbit–Lopes substitution conjecture. If is polynomially -bounded, then so is . This conjecture extends the analogous graph statement that substitution preserves polynomial -boundedness. The paper proves it for classes of tournaments with bounded dichromatic number; the general case 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.