Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01094084n
Noun Named Entity
SYL
No term available
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
Relations
Sources
IS A
EN
theorem
NAMED AFTER
EN
Frank Ramsey

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