Add to ORKGThe size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we consider the size-Ramsey number of cliques, paths, trees, and bounded degree hypergraphs. Our results suggest that size-Ramsey numbers for hypergraphs are extremely difficult to determine, and many open problems remain
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted G→(H)s, if every s-colourin...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...
In this paper, we study an analogue of size-Ramsey numbers for vertex colorings. For a given number ...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is...
For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest ...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
Given a positive integer (Formula presented.), the (Formula presented.) -colour size-Ramsey number o...
Given a positive integer (Formula presented.), the (Formula presented.) -colour size-Ramsey number o...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted G→(H)s, if every s-colourin...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...
In this paper, we study an analogue of size-Ramsey numbers for vertex colorings. For a given number ...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is...
For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest ...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
Given a positive integer (Formula presented.), the (Formula presented.) -colour size-Ramsey number o...
Given a positive integer (Formula presented.), the (Formula presented.) -colour size-Ramsey number o...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted G→(H)s, if every s-colourin...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbi...