See Ramsey's theorem on Wiktionary
{
"etymology_text": "Named after British mathematician and philosopher Frank P. Ramsey.",
"forms": [
{
"form": "Ramsey's theorems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "Ramsey's theorem (countable and uncountable, plural Ramsey's theorems)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques."
],
"id": "en-Ramsey's_theorem-en-noun-FiKraWYV",
"links": [
[
"mathematics",
"mathematics"
],
[
"clique",
"clique"
],
[
"complete graph",
"complete graph"
]
],
"raw_glosses": [
"(mathematics) A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique."
],
"id": "en-Ramsey's_theorem-en-noun-qKMGvzfo",
"links": [
[
"mathematics",
"mathematics"
],
[
"clique",
"clique"
],
[
"complete graph",
"complete graph"
]
],
"raw_glosses": [
"(mathematics) A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique."
],
"synonyms": [
{
"_dis1": "41 59",
"sense": "infinite version of theorem",
"word": "infinite Ramsey's theorem"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"synonyms": [
{
"_dis1": "50 50",
"sense": "finite version of theorem",
"word": "finite Ramsey's theorem"
}
],
"wikipedia": [
"Frank P. Ramsey",
"Ramsey's theorem"
],
"word": "Ramsey's theorem"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_text": "Named after British mathematician and philosopher Frank P. Ramsey.",
"forms": [
{
"form": "Ramsey's theorems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "Ramsey's theorem (countable and uncountable, plural Ramsey's theorems)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"en:Mathematics"
],
"glosses": [
"A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"clique",
"clique"
],
[
"complete graph",
"complete graph"
]
],
"raw_glosses": [
"(mathematics) A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"clique",
"clique"
],
[
"complete graph",
"complete graph"
]
],
"raw_glosses": [
"(mathematics) A (version of a) theorem concerning the existence of cliques in a labelled complete graph.",
"The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"synonyms": [
{
"sense": "finite version of theorem",
"word": "finite Ramsey's theorem"
},
{
"sense": "infinite version of theorem",
"word": "infinite Ramsey's theorem"
}
],
"wikipedia": [
"Frank P. Ramsey",
"Ramsey's theorem"
],
"word": "Ramsey's theorem"
}
Download raw JSONL data for Ramsey's theorem meaning in All languages combined (2.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-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.