"Whitney's theorem" meaning in English

See Whitney's theorem in All languages combined, or Wiktionary

Proper name

Etymology: Introduced by Hassler Whitney (1907–1989), American mathematician. Head templates: {{en-proper noun}} Whitney's theorem
  1. A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K₃, the complete graph on three vertices, and the complete bipartite graph K_(1,3), which are not isomorphic but both have K₃ as their line graph. Wikipedia link: Hassler Whitney, Whitney embedding theorem
    Sense id: en-Whitney's_theorem-en-name-vUu8NHvE Categories (other): English entries with incorrect language header, English entries with language name categories using raw markup, English terms with non-redundant non-automated sortkeys

Download JSON data for Whitney's theorem meaning in English (1.5kB)

{
  "etymology_text": "Introduced by Hassler Whitney (1907–1989), American mathematician.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Whitney's 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": "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"
        }
      ],
      "examples": [
        {
          "text": "Whitney's theorem can be extended to hypergraphs."
        }
      ],
      "glosses": [
        "A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K₃, the complete graph on three vertices, and the complete bipartite graph K_(1,3), which are not isomorphic but both have K₃ as their line graph."
      ],
      "id": "en-Whitney's_theorem-en-name-vUu8NHvE",
      "links": [
        [
          "connected graph",
          "connected graph"
        ],
        [
          "isomorphic",
          "isomorphic"
        ],
        [
          "line graph",
          "line graph"
        ],
        [
          "exception",
          "exception"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "bipartite",
          "bipartite"
        ]
      ],
      "wikipedia": [
        "Hassler Whitney",
        "Whitney embedding theorem"
      ]
    }
  ],
  "word": "Whitney's theorem"
}

{
  "etymology_text": "Introduced by Hassler Whitney (1907–1989), American mathematician.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Whitney's theorem",
      "name": "en-proper noun"
    }
  ],
  "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"
      ],
      "examples": [
        {
          "text": "Whitney's theorem can be extended to hypergraphs."
        }
      ],
      "glosses": [
        "A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K₃, the complete graph on three vertices, and the complete bipartite graph K_(1,3), which are not isomorphic but both have K₃ as their line graph."
      ],
      "links": [
        [
          "connected graph",
          "connected graph"
        ],
        [
          "isomorphic",
          "isomorphic"
        ],
        [
          "line graph",
          "line graph"
        ],
        [
          "exception",
          "exception"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "bipartite",
          "bipartite"
        ]
      ],
      "wikipedia": [
        "Hassler Whitney",
        "Whitney embedding theorem"
      ]
    }
  ],
  "word": "Whitney's theorem"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-03 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.