MathDBThe poset tournament rebel conjecture
The poset tournament rebel conjecture
A tournament is a rebel if the class of tournaments not containing has bounded domination number. A poset tournament is a tournament admitting an ordering whose backedge graph is a comparability graph. The poset tournament rebel conjecture. Every poset tournament is a rebel. The forward implication, that every rebel is a poset tournament, is known; the converse remains open.
Sources & referencesView supporting material
Primary source
Pierre Aboulker, Guillaume Aubian, Pierre Charbit and Raul Lopes, “Clique number of tournaments”, arXiv:2310.04265 (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
Sign in to submit a solution.
No solutions have been posted yet.