Title of article :
Weakened Ramsey numbers Original Research Article
Author/Authors :
Heiko Harborth، نويسنده , , Meinhard M?ller، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
6
From page :
279
To page :
284
Abstract :
Classical Ramsey numbers r=rt(G) ask for the smallest number r such that every t-coloring of the edges of the complete graph Kr contains a monochromatic copy of a given graph G. Weakened Ramsey numbers Rs,t(G) ask in every t-coloring of KR for a copy of G with at most s colors, s
Keywords :
Ramsey number , t-coloring
Journal title :
Discrete Applied Mathematics
Serial Year :
1999
Journal title :
Discrete Applied Mathematics
Record number :
884953
Link To Document :
