Burr, S. A.


Oriented trees in n-chromatic digraphs ★★★

Author(s): Burr

\begin{conjecture} Every digraph with chromatic number at least $2k-2$ contains every oriented tree of order $k$ as a subdigraph. \end{conjecture}

Keywords:

Syndicate content