The local-to-global conjecture for tournament clique number

From papers

For a tournament TT, let N+(v)N^+(v) denote the out-neighbourhood of vv, and let ω(T)\operatorname{\overrightarrow{\omega}}(T) denote the clique number. The local-to-global clique-number conjecture. There exists a function gg such that, for every integer tt, if TT is a tournament such that for every vV(T)v\in V(T), ω(N+(v))t\operatorname{\overrightarrow{\omega}}(N^+(v))\leq t, then ω(T)g(t)\operatorname{\overrightarrow{\omega}}(T)\leq g(t). 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

No solutions have been posted yet.