Source: wikibot/grotzsch-graph
= Grötzsch graph
{wiki=Grötzsch_graph}
The Grötzsch graph is an important example in graph theory, particularly known for being a minimal example of a triangle-free graph that does not have a 3-coloring. The graph was named after the German mathematician Kurt Grötzsch, who constructed it in 1959. Here are some key characteristics of the Grötzsch graph: 1. **Vertices and Edges**: The Grötzsch graph consists of 11 vertices and 20 edges.