The local-to-global conjecture for tournament clique number
The local-to-global conjecture for tournament clique number
For a tournament , let denote the out-neighbourhood of , and let denote the clique number. The local-to-global clique-number conjecture. There exists a function such that, for every integer , if is a tournament such that for every , , then . This is presented as the clique-number analogue of a known local-to-global theorem for dichromatic number and remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Pierre Aboulker, Guillaume Aubian, Pierre Charbit and Raul Lopes, “Clique number of tournaments”, arXiv:2310.04265 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.