DOIAbstract
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all sufficiently large n
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all sufficiently large n
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
The upper bound of Ramsey numbers on complete bipartite graph was shown, namely R(K1,p,Kn,m ) m+2p-2...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
The upper bound of Ramsey numbers on complete bipartite graph was shown, namely R(K1,p,Kn,m ) m+2p-2...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
Add to ORKG