"Grötzsch's theorem" meaning in English

See Grötzsch's theorem in All languages combined, or Wiktionary

Proper name

Etymology: Named after German mathematician Herbert Grötzsch, who published a proof in 1959. Head templates: {{en-prop}} Grötzsch's theorem
  1. (graph theory) The statement that every triangle-free planar graph has a coloring using only three colors.
    Sense id: en-Grötzsch's_theorem-en-name-FS-kfOjN Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries, Graph theory Topics: graph-theory, mathematics, sciences
{
  "etymology_text": "Named after German mathematician Herbert Grötzsch, who published a proof in 1959.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Grötzsch's theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "The statement that every triangle-free planar graph has a coloring using only three colors."
      ],
      "id": "en-Grötzsch's_theorem-en-name-FS-kfOjN",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle",
          "triangle"
        ],
        [
          "planar graph",
          "planar graph"
        ],
        [
          "coloring",
          "coloring"
        ],
        [
          "color",
          "color"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The statement that every triangle-free planar graph has a coloring using only three colors."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Grötzsch's theorem"
}
{
  "etymology_text": "Named after German mathematician Herbert Grötzsch, who published a proof in 1959.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Grötzsch's theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Ö",
        "English terms spelled with ◌̈",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The statement that every triangle-free planar graph has a coloring using only three colors."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle",
          "triangle"
        ],
        [
          "planar graph",
          "planar graph"
        ],
        [
          "coloring",
          "coloring"
        ],
        [
          "color",
          "color"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The statement that every triangle-free planar graph has a coloring using only three colors."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Grötzsch's theorem"
}

Download raw JSONL data for Grötzsch's theorem meaning in English (1.0kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-05-10 from the enwiktionary dump dated 2025-05-01 using wiktextract (85b9f46 and 1b6da77). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.