AbstractWe construct two prime-order cyclic graphs, and use them to obtain two new lower bounds for two classical Ramsey numbers: R(5,13) ≥ 174, R(5,14) ≥ 200
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
We discuss some computational challenges and related open questions concerning classical Ramsey numb...
AbstractWe construct two prime-order cyclic graphs, and use them to obtain two new lower bounds for ...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
We improve the upper bound on the Ramsey number R(5, 5) from ≤49 to ≤48. We also complete the catalo...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
We discuss some computational challenges and related open questions concerning classical Ramsey numb...
AbstractWe construct two prime-order cyclic graphs, and use them to obtain two new lower bounds for ...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
We improve the upper bound on the Ramsey number R(5, 5) from ≤49 to ≤48. We also complete the catalo...
AbstractThis note describes two lemmas for Ramsey number R (p, q; 4), which help us to deduce lower ...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short ov...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
We discuss some computational challenges and related open questions concerning classical Ramsey numb...
DOI
Add to ORKG