Title of article
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
Author/Authors
McDiarmid، نويسنده , , Colin and Steger، نويسنده , , Angelika، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
6
From page
147
To page
152
Abstract
There is a family (Hk) of graphs such thatHkhas order[formula]but has no clique or stable set of orderk. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbersR(k, k). Here we see that the graphsHkcan be taken to be regular, self-complementary, and pseudo-random.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series A
Record number
1530101
Link To Document