ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A digraph is kk-universal if it is contained in every digraph with chromatic number kk. 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 nn with kk leaves is (n+k−1)(n+k-1)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.