See Veblen's theorem on Wiktionary
{
"etymology_text": "Introduced by Oswald Veblen in 1912.",
"head_templates": [
{
"args": {},
"expansion": "Veblen'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 theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree."
],
"id": "en-Veblen's_theorem-en-name-lCUBIpsq",
"links": [
[
"graph theory",
"graph theory"
],
[
"set",
"set"
],
[
"edge",
"edge"
],
[
"finite",
"finite"
],
[
"graph",
"graph"
],
[
"union",
"union"
],
[
"disjoint",
"disjoint"
],
[
"simple",
"simple"
],
[
"cycle",
"cycle"
],
[
"vertex",
"vertex"
],
[
"even",
"even"
],
[
"degree",
"degree"
]
],
"raw_glosses": [
"(graph theory) A theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Veblen's theorem"
]
}
],
"word": "Veblen's theorem"
}
{
"etymology_text": "Introduced by Oswald Veblen in 1912.",
"head_templates": [
{
"args": {},
"expansion": "Veblen'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 theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"set",
"set"
],
[
"edge",
"edge"
],
[
"finite",
"finite"
],
[
"graph",
"graph"
],
[
"union",
"union"
],
[
"disjoint",
"disjoint"
],
[
"simple",
"simple"
],
[
"cycle",
"cycle"
],
[
"vertex",
"vertex"
],
[
"even",
"even"
],
[
"degree",
"degree"
]
],
"raw_glosses": [
"(graph theory) A theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Veblen's theorem"
]
}
],
"word": "Veblen's theorem"
}
Download raw JSONL data for Veblen'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.