On the size-Ramsey number of hypergraphs

Andrzej Dudek, Steven La Fleur, Dhruv Mubayi +1

The 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 o…