1 problem

Reed's recolouring conjecture. Any graph $G$ is $k$-recolourable for all