Grötzsch graph
Grötzsch graph noun: a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence.
Noun
Grötzsch graph (plural Grötzsch graphs)
- A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence.
Forms of Grötzsch graph
| plural | Grötzsch graphs |
|---|
Origin of Grötzsch graph
Named after German mathematician Herbert Grötzsch.
Questions about Grötzsch graph
- What does Grötzsch graph mean?
- Grötzsch graph means a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence.
- What part of speech is Grötzsch graph?
- Grötzsch graph is a noun.
- What is the plural of Grötzsch graph?
- The plural of Grötzsch graph is Grötzsch graphs.
Words near Grötzsch graph in the dictionary
Source and license
Adapted from Wiktionary: Grötzsch graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Grötzsch graph.” Word.ws, https://word.ws/gr%C3%B6tzsch_graph. Based on Wiktionary, CC BY-SA 4.0.
