DOIAbstract
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK3 consists of n disjoint complete triangles, are calculated
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK3 consists of n disjoint complete triangles, are calculated
In this note, we revisit the problem of calculating small on-line Ramsey numbers R(G,H). A new appro...
AbstractThe main results of this paper are N(3,3,3,3;2) > 50 and f(k+1)≥3 f(k)+f(k−2), where f(k) = ...
AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of ...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers ...
SIGLEAvailable from British Library Document Supply Centre-DSC:8723.4018(85) / BLDSC - British Libra...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
The Ramsey number R(C4,Km) is the smallest n such that any graph on n vertices contains a cycle of l...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
In this note, we revisit the problem of calculating small on-line Ramsey numbers R(G,H). A new appro...
AbstractThe main results of this paper are N(3,3,3,3;2) > 50 and f(k+1)≥3 f(k)+f(k−2), where f(k) = ...
AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of ...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
AbstractFor the graphs K7 − 2P2 and K7 − 3P2 we give a proof of their triangle-graph Ramsey numbers ...
SIGLEAvailable from British Library Document Supply Centre-DSC:8723.4018(85) / BLDSC - British Libra...
AbstractWith the help of a computer, the Ramsey numbers r3(H) are obtained for each of the 19 graphs...
The Ramsey number R(C4,Km) is the smallest n such that any graph on n vertices contains a cycle of l...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
In this note, we revisit the problem of calculating small on-line Ramsey numbers R(G,H). A new appro...
AbstractThe main results of this paper are N(3,3,3,3;2) > 50 and f(k+1)≥3 f(k)+f(k−2), where f(k) = ...
AbstractThe triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of ...
Add to ORKG