Events by date

Title: An into introduction to the chromatic number of digraph

Speaker: Alvaro Carbonero Gonzales Affiliation: University of Waterloo Room: MC 5417, please contact Shalya Redlin for zoom link

Abstract: A proper $k$-coloring of a digraph $D$ is a coloring of the vertices such that every color class is acyclic, and the dichromatic number of a digraph $D$ is the minimum number $k$ such that there is a proper $k$-coloring of $D$. Many questions about the chromatic number can be asked about the dichromatic number, but as one will quickly observe, unsuspected complications arise when dealing with digraphs.