Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01094084n
Noun Named Entity
Categories: Theorems in graph theory, Articles containing proofs, Ramsey theory, Articles with short description
EN
Ramsey's theorem  R  Ramsey number  Ramsey numbers  Ramsey theorem
EN
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling of a sufficiently large complete graph. Wikipedia
Definitions
Relations
Sources
EN
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling of a sufficiently large complete graph. Wikipedia
Theorem in combinatorial mathematics Wikidata
IS A
theorem
NAMED AFTER
Frank Ramsey
Wikipedia
EN
Ramsey's theorem
Wikidata
EN
Ramsey's theorem
Wikipedia Redirections
EN
R(5, 5), Ramsey's Theorem, Ramsey number, Ramsey numbers, Ramsey theorem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License