Difference between revisions of "Ramsey Number"
PhoebeJiang (talk  contribs) 
PhoebeJiang (talk  contribs) 

Line 5:  Line 5:  
__TOC__  __TOC__  
+  ==Definition==  
Ramsey number is the solution to the party problems, which ask the minimum number of guests that must be invited so that at least m will know each other or at least n will not know each other.  Ramsey number is the solution to the party problems, which ask the minimum number of guests that must be invited so that at least m will know each other or at least n will not know each other.  
+  
+  ==Bounds==  
+  
+  ==Examples== 
Revision as of 00:11, 21 July 2011
This is a Helper Page for:


Pigeonhole Principle 
Work In Progress
Contents
Definition
Ramsey number is the solution to the party problems, which ask the minimum number of guests that must be invited so that at least m will know each other or at least n will not know each other.