"four color theorem" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {},
      "expansion": "four color theorem",
      "name": "en-proper noun"
    }
  ],
  "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Four",
          "orig": "en:Four",
          "parents": [
            "Numbers",
            "All topics",
            "Terms by semantic function",
            "Fundamental"
          ],
          "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": [
        "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)."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "four color theorem"
}

{
  "head_templates": [
    {
      "args": {},
      "expansion": "four color theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "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"
}