See Kruskal's tree theorem on Wiktionary
{
"etymology_text": "The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).",
"head_templates": [
{
"args": {},
"expansion": "Kruskal's tree theorem",
"name": "en-prop"
}
],
"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": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding."
],
"id": "en-Kruskal's_tree_theorem-en-name-GhWsxTar",
"links": [
[
"mathematics",
"mathematics"
],
[
"set",
"set"
],
[
"finite",
"finite"
],
[
"tree",
"tree"
],
[
"label",
"label"
],
[
"homeomorphic",
"homeomorphic"
],
[
"embedding",
"embedding"
]
],
"raw_glosses": [
"(mathematics) A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding."
],
"related": [
{
"word": "TREE"
}
],
"topics": [
"mathematics",
"sciences"
]
}
],
"word": "Kruskal's tree theorem"
}
{
"etymology_text": "The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).",
"head_templates": [
{
"args": {},
"expansion": "Kruskal's tree theorem",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "TREE"
}
],
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Mathematics"
],
"glosses": [
"A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"set",
"set"
],
[
"finite",
"finite"
],
[
"tree",
"tree"
],
[
"label",
"label"
],
[
"homeomorphic",
"homeomorphic"
],
[
"embedding",
"embedding"
]
],
"raw_glosses": [
"(mathematics) A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"word": "Kruskal's tree theorem"
}
Download raw JSONL data for Kruskal's tree theorem meaning in All languages combined (1.1kB)
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-26 from the enwiktionary dump dated 2025-02-21 using wiktextract (ce0be54 and f2e72e5). 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.