# 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:

Author(s): Burr

Keywords:

- Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (222)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)

- Author index
- Keyword index