|
For a given graph \(G\), its size-Ramsey number is the minimum number of edges in a graph \(H\) such that any 2-coloring of the edges of \(H\) yields a monochromatic copy of \(G\). This concept was introduced by Erdős, Faudree, Rousseau, and Schelp and considered by several other researchers. Somewhat surprisingly this idea has not yet been extended to hypergraphs, even though classical Ramsey numbers for hypergraphs have been studied extensively.
In this talk, we focus on this new direction of research.
|
