AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers without using any computer support
AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such th...
AbstractThe Ramsey–Schur number RS(s,m) is the smallest n such that every 2-coloring (green/red) of ...
We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the fi...
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 ...
AbstractThe induced Ramsey number, IR(G,H), is equal to p if there exists a graph F on p vertices su...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
For graphs G1, G2, G3, the three-color Ramsey number R(G1, G2, G3) is the smallest integer n such th...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that a...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such th...
AbstractThe Ramsey–Schur number RS(s,m) is the smallest n such that every 2-coloring (green/red) of ...
We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the fi...
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 ...
AbstractThe induced Ramsey number, IR(G,H), is equal to p if there exists a graph F on p vertices su...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
For graphs G1, G2, G3, the three-color Ramsey number R(G1, G2, G3) is the smallest integer n such th...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that a...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such th...
AbstractThe Ramsey–Schur number RS(s,m) is the smallest n such that every 2-coloring (green/red) of ...
We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the fi...
DOI
Add to ORKG