See Ore's theorem on Wiktionary
{
"etymology_text": "Proved in 1960 by Norwegian mathematician Øystein Ore.",
"head_templates": [
{
"args": {},
"expansion": "Ore'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": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
}
],
"glosses": [
"A theorem that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian."
],
"id": "en-Ore's_theorem-en-name-UjUre2af",
"links": [
[
"graph theory",
"graph theory"
],
[
"sum",
"sum"
],
[
"degree",
"degree"
],
[
"pair",
"pair"
],
[
"adjacent",
"adjacent"
],
[
"vertices",
"vertex"
],
[
"Hamiltonian",
"Hamiltonian"
]
],
"raw_glosses": [
"(graph theory) A theorem that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian."
],
"related": [
{
"word": "Ore condition"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Ore's theorem"
]
}
],
"word": "Ore's theorem"
}
{
"etymology_text": "Proved in 1960 by Norwegian mathematician Øystein Ore.",
"head_templates": [
{
"args": {},
"expansion": "Ore's theorem",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "Ore condition"
}
],
"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 that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"sum",
"sum"
],
[
"degree",
"degree"
],
[
"pair",
"pair"
],
[
"adjacent",
"adjacent"
],
[
"vertices",
"vertex"
],
[
"Hamiltonian",
"Hamiltonian"
]
],
"raw_glosses": [
"(graph theory) A theorem that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Ore's theorem"
]
}
],
"word": "Ore's theorem"
}
Download raw JSONL data for Ore's theorem meaning in All languages combined (1.3kB)
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-05-24 from the enwiktionary dump dated 2025-05-20 using wiktextract (5d527b9 and f1c2b61). 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.