"Grötzsch's theorem" meaning in All languages combined

See Grötzsch's theorem on Wiktionary

Proper name [English]

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. Categories (topical): Graph theory
{
  "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": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Ö",
        "English terms spelled with ◌̈",
        "English terms with non-redundant non-automated sortkeys",
        "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 All languages combined (1.1kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.