Amadeus Reinald gave a talk on finding an oriented tree inside a digraph of large chromatic number at the Discrete Math Seminar

On September 3, 2024, Amadeus Reinald from LIRMM, Université de Montpellier gave a talk at the Discrete Math Seminar on the existence of every oriented tree of fixed size inside a digraph of large chromatic number. The title of his talk was “Oriented trees in $O(k\sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr’s conjecture“.