AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-coloring of B contains either a red B1 or a blue B2. The size bipartite Ramsey number br̂(B1,B2) is defined as the minimum number of edges of a bipartite graph B such that B→(B1,B2). It is shown that br̂(Km,n,Km,n) is linear on n with m fixed, and br̂(Kn,n,Kn,n) is between c1n22n and c2n32n for some positive constants c1 and c2
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F a...
AbstractIn this note we prove that the (diagonal) size Ramsey number of Kn.n is bounded below by 1/6...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F a...
AbstractIn this note we prove that the (diagonal) size Ramsey number of Kn.n is bounded below by 1/6...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b suc...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
DOI
Add to ORKG