The substitution conjecture for dichromatically bounded digraph classes

A class of digraphs C\mathcal C is dichromatically bounded if its dichromatic number is bounded as a function of its clique number. The substitution conjecture. If a class of digraphs C\mathcal C is χ\operatorname{\overrightarrow{\chi}}-bounded, then so is its closure under substitution. The paper presents this as a future direction; it is not established for general digraphs.

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

No solutions have been posted yet.