Grötzsch's theorem
= Grötzsch's theorem
{wiki=Grötzsch's_theorem}
Grötzsch's theorem is a result in graph theory concerning the coloring of graphs. Specifically, it states that there exists a triangle-free graph that requires four colors for a proper vertex coloring. In other words, it demonstrates that the chromatic number of certain triangle-free graphs can be as high as four.