Leaf-sensitive oriented-tree universality conjecture
Statement
A digraph is -universal if it is contained in every digraph with chromatic number . An oriented tree is an orientation of an undirected tree, and a leaf is a vertex of degree one in its underlying tree. Leaf-sensitive universality conjecture. Every oriented tree of order with leaves is -universal. This is proposed as the universality analogue of the leaf-sensitive unavoidability conjecture, and no resolution is given in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.