Graphs and Matroids Seminar - Lise Turner

Title: Cluster chromatic number of $G(n,p)$

Abstract: A colouring of a graph $G$ is said to be $\kappa$-clustered if no colour class has a connected component with more than $\kappa$ vertices. In this talk, we give the $\kappa$-clustered chromatic number of $G(n,p)$ for $\kappa$ increasing at various rates with respect to $n$.

The talk is joint work with Jane Gao.