Publication date
September 1990
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher order numbers
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher order numbers
AbstractThe Ramsey number M(p,q) is the greatest integer such that for each n<M(p,q), it is possible...
AbstractGiveni,jpositive integers, letKi,jdenote a bipartite complete graph and letRr(m,n) be the sm...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
For graphs G_1,G_2,...,G_m the Ramsey number R(G_1,G_2,...,G_m) is defined to be the smallest intege...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
AbstractLet n, r, u1, u2,…,uk be positive integers satisfying ui ⩾ r for i = 1,2,…,k. The symbol n →...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
The finite version of Ramsey's theorem says that for positive integers r, k, a_1,... ,a_r, there exi...
In this article we use two di#erent methods to find new lower bounds for some multicolored Ramsey n...
AbstractThe Ramsey number M(p,q) is the greatest integer such that for each n<M(p,q), it is possible...
AbstractGiveni,jpositive integers, letKi,jdenote a bipartite complete graph and letRr(m,n) be the sm...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
For graphs G_1,G_2,...,G_m the Ramsey number R(G_1,G_2,...,G_m) is defined to be the smallest intege...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
AbstractLet n, r, u1, u2,…,uk be positive integers satisfying ui ⩾ r for i = 1,2,…,k. The symbol n →...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
The finite version of Ramsey's theorem says that for positive integers r, k, a_1,... ,a_r, there exi...
In this article we use two di#erent methods to find new lower bounds for some multicolored Ramsey n...
AbstractThe Ramsey number M(p,q) is the greatest integer such that for each n<M(p,q), it is possible...
AbstractGiveni,jpositive integers, letKi,jdenote a bipartite complete graph and letRr(m,n) be the sm...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
Add to ORKG