Title of article :
New Upper Bounds for Ramsey Numbers
Author/Authors :
Huang، نويسنده , , Y.R and Zhang، نويسنده , , K.M، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
The Ramsey numberR(G1,G2) is the smallest integerpsuch that for any graphGonpvertices eitherGcontainsG1orGcontainsG2, whereGdenotes the complement ofG. LetR(m,n) = R(Km,Kn). Some new upper bound formulas are obtained forR(G1,G2andR(m,n), and we derive some new upper bounds for Ramsey numbers here.
Journal title :
European Journal of Combinatorics
Journal title :
European Journal of Combinatorics
