AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Ramsey number bk(m,n) are both asymptotically equal to kmn as n→∞, and that for any graph H on m vertices, the two-color Ramsey number r(H+K¯n,Kn) is at most (1+o(1))nm+1/(logn)m-1. Moreover, the order of magnitude of r(H+K¯n,Kn) is proved to be nm+1/(logn)m if H≠Km as n→∞
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is...
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....
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractIt is shown that the order of magnitude of the k-color Ramsey numbers rk(C2m) is km/(m−1) fo...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all s...
We study two problems in graph Ramsey theory. In the early 1970s, Erdős and O'Neil considered a...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges ...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is...
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....
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractIt is shown that the order of magnitude of the k-color Ramsey numbers rk(C2m) is km/(m−1) fo...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all s...
We study two problems in graph Ramsey theory. In the early 1970s, Erdős and O'Neil considered a...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges ...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is...
DOI
Add to ORKG