AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of order seven. For the remaining 39 graphs lower and upper bounds are improved
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of ...
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers ...
In this article we give the generalized triangle Ramsey numbers R(K3, G) of 12 005 158 of the 12 005...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
Ramsey theory studies the existence of highly regular patterns in large sets of objects. Given two g...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the fi...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of ...
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers ...
In this article we give the generalized triangle Ramsey numbers R(K3, G) of 12 005 158 of the 12 005...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
Ramsey theory studies the existence of highly regular patterns in large sets of objects. Given two g...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the fi...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
DOI
Add to ORKG