Burr, S. A.

Oriented trees in n-chromatic digraphs ★★★

Author(s): Burr

Conjecture Every digraph with chromatic number at least $2k-2$ contains every oriented tree of order $k$ as a subdigraph.

Keywords:

Posted by fhavet
updated February 25th, 2013