"four color theorem" meaning in All languages combined

See four color theorem on Wiktionary

Proper name [English]

Forms: the four color theorem [canonical]
Head templates: {{en-prop|def=1}} the four color theorem
  1. (graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary). Related terms: four color problem
    Sense id: en-four_color_theorem-en-name-o4TVVmWI Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries, Four, Graph theory Topics: graph-theory, mathematics, sciences
{
  "forms": [
    {
      "form": "the four color theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the four color 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": "Four",
          "orig": "en:Four",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary)."
      ],
      "id": "en-four_color_theorem-en-name-o4TVVmWI",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "contiguous",
          "contiguous"
        ],
        [
          "map",
          "map#English"
        ],
        [
          "four",
          "four"
        ],
        [
          "require",
          "require"
        ],
        [
          "adjacent",
          "adjacent"
        ],
        [
          "adjacent",
          "adjacent#English"
        ],
        [
          "corner",
          "corner"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary)."
      ],
      "related": [
        {
          "word": "four color problem"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "four color theorem"
}
{
  "forms": [
    {
      "form": "the four color theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the four color theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "related": [
    {
      "word": "four color problem"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Four",
        "en:Graph theory"
      ],
      "glosses": [
        "A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary)."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "contiguous",
          "contiguous"
        ],
        [
          "map",
          "map#English"
        ],
        [
          "four",
          "four"
        ],
        [
          "require",
          "require"
        ],
        [
          "adjacent",
          "adjacent"
        ],
        [
          "adjacent",
          "adjacent#English"
        ],
        [
          "corner",
          "corner"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary)."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "four color theorem"
}

Download raw JSONL data for four color theorem meaning in All languages combined (1.6kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-29 from the enwiktionary dump dated 2025-05-20 using wiktextract (e937b02 and f1c2b61). 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.