Assertion: grötzsch graph | /r/CapableOf | repeat mycielskian construction
Facets:
Source sentences:
text: For any positive integers g and χ, there exists a graph with girth at least g and 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.