1.Previous
3.Next

chromatic number at least ; for instance, the Grötzsch graph is triangle-free and has chromatic number 4, and repeating the Mycielskian construction used to form the Grötzsch graph produces triangle-free graphs of arbitrarily large chromatic number. Paul Erdos was the first to prove the general result, using the probabilistic method. More

1.Previous
3.Next