Add to ORKGThis paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results, and then by presenting several general constructions establishing new lower bounds for many diagonal and off-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for R_k(4) and R_k(5) for some small k, including 415 \u3c = R_3(5), 634 \u3c = R_4(4), 2721 \u3c = R_4(5), 3416 \u3c = R_5(4) and 26082 \u3c = R_5(5). Most of the new lower bounds are consequences of general constructions
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
In this article we use two di#erent methods to find new lower bounds for some multicolored Ramsey n...
In this paper the algorithm developed in [RK] for 2-color Ramsey numbers is generalized to multi-col...
In this paper the algorithm developed in [RK] for 2-color Ramsey numbers is generalized to multi-col...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
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...
AbstractLet G be an r-uniform hypergraph. The multicolor Ramsey number rk(G) is the minimum n such t...
AbstractWe show that 28⩽r(K4−e;3)⩽32. The construction used to establish the lower bound is made by ...
Ramsey Theory studies conditions when a combinatorial object contains necessarily some smaller given...
We provide proofs to check and exposit Exoo's construction of a colouring on $K_{42}$ that demonstra...
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ove...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
In this article we use two di#erent methods to find new lower bounds for some multicolored Ramsey n...
In this paper the algorithm developed in [RK] for 2-color Ramsey numbers is generalized to multi-col...
In this paper the algorithm developed in [RK] for 2-color Ramsey numbers is generalized to multi-col...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
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...
AbstractLet G be an r-uniform hypergraph. The multicolor Ramsey number rk(G) is the minimum n such t...
AbstractWe show that 28⩽r(K4−e;3)⩽32. The construction used to establish the lower bound is made by ...
Ramsey Theory studies conditions when a combinatorial object contains necessarily some smaller given...
We provide proofs to check and exposit Exoo's construction of a colouring on $K_{42}$ that demonstra...
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...