Hadwiger-Nelson problem in English

[Show JSON for postprocessed kaikki.org data shown on this page ▼] [Hide JSON for postprocessed kaikki.org data shown on this page ▲]

{
  "etymology_text": "Named after Hugo Hadwiger and Edward Nelson.",
  "forms": [
    {
      "form": "the Hadwiger-Nelson problem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Hadwiger-Nelson problem",
      "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": "English entries with language name categories using raw markup",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "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 problem of determining the minimum number of colors required to color the plane such that no two points at distance 1 from each other have the same color."
      ],
      "id": "en-Hadwiger-Nelson_problem-en-name-NvnxsN0e",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "point",
          "point"
        ],
        [
          "distance",
          "distance"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of determining the minimum number of colors required to color the plane such that no two points at distance 1 from each other have the same color."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Hadwiger-Nelson problem"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "etymology_text": "Named after Hugo Hadwiger and Edward Nelson.",
  "forms": [
    {
      "form": "the Hadwiger-Nelson problem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Hadwiger-Nelson problem",
      "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 with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The problem of determining the minimum number of colors required to color the plane such that no two points at distance 1 from each other have the same color."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "point",
          "point"
        ],
        [
          "distance",
          "distance"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of determining the minimum number of colors required to color the plane such that no two points at distance 1 from each other have the same color."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Hadwiger-Nelson problem"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2026-10-30 from the enwiktionary dump dated 2026-10-01 using wiktextract (19f9a30 and 6f96ddf). 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.

"Hadwiger-Nelson problem" meaning in English

Proper name