Amadeus Reinald, Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr’s conjecture
Room B332 IBS (기초과학연구원)In 1980, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices, which …