See Menger's theorem on Wiktionary
{
"etymology_text": "It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.",
"head_templates": [
{
"args": {},
"expansion": "Menger'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"
},
{
"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 characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices."
],
"id": "en-Menger's_theorem-en-name-Rlxu4dao",
"links": [
[
"graph theory",
"graph theory"
],
[
"connectivity",
"connectivity"
],
[
"finite",
"finite"
],
[
"undirected graph",
"undirected graph"
],
[
"minimum",
"minimum"
],
[
"disjoint",
"disjoint"
],
[
"path",
"path"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(graph theory) A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Menger's theorem"
]
}
],
"word": "Menger's theorem"
}
{
"etymology_text": "It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.",
"head_templates": [
{
"args": {},
"expansion": "Menger'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 uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"connectivity",
"connectivity"
],
[
"finite",
"finite"
],
[
"undirected graph",
"undirected graph"
],
[
"minimum",
"minimum"
],
[
"disjoint",
"disjoint"
],
[
"path",
"path"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(graph theory) A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Menger's theorem"
]
}
],
"word": "Menger's theorem"
}
Download raw JSONL data for Menger'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 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.