See Whitney's theorem on Wiktionary
{
"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": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
}
],
"examples": [
{
"text": "Whitney's theorem can be extended to hypergraphs.",
"type": "example"
}
],
"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 eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with usage examples",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"examples": [
{
"text": "Whitney's theorem can be extended to hypergraphs.",
"type": "example"
}
],
"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"
}
Download raw JSONL data for Whitney's theorem meaning in All languages combined (1.2kB)
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-02-17 from the enwiktionary dump dated 2025-02-02 using wiktextract (ca09fec and c40eb85). 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.