Ramsey numbers r(K3, G) for G ≅ K7 − 2P2 and G ≅ K7 − 3P2
- Schelten, Annette
- Schiermeyer, Ingo
DOIAbstract
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers without using any computer support
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers without using any computer support
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
For two given graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $p$ su...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
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...
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 ...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For two given graphs G and H, the Ramsey number R(G,H) is the smallest positive integer p such that ...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
Abstract. We give a computer-assisted proof of the fact that R(K5 − P3,K5) = 25. This solves one of...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
For two given graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $p$ su...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
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...
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 ...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For two given graphs G and H, the Ramsey number R(G,H) is the smallest positive integer p such that ...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
Abstract. We give a computer-assisted proof of the fact that R(K5 − P3,K5) = 25. This solves one of...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
For two given graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $p$ su...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
Add to ORKG