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
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
We determine the value of the Ramsey number R(W5;K5) to be 27, where W5 = K1 + C4 is the 4-spoked wh...
AbstractWe construct two prime-order cyclic graphs, and use them to obtain two new lower bounds for ...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
1991 Mathematics Subject Classification. 05D10, 05C80.We present new explicit lower bounds for some ...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
We determine the value of the Ramsey number R(W5;K5) to be 27, where W5 = K1 + C4 is the 4-spoked wh...
AbstractWe construct two prime-order cyclic graphs, and use them to obtain two new lower bounds for ...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
1991 Mathematics Subject Classification. 05D10, 05C80.We present new explicit lower bounds for some ...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
We determine the value of the Ramsey number R(W5;K5) to be 27, where W5 = K1 + C4 is the 4-spoked wh...
DOI
Add to ORKG