Graph Coloring · Superchallenge problem

The Petersen graph has $\chi=3$. Over all proper $3$-colorings, what is the SMALLEST possible size of its largest color class?