On the size-Ramsey number of hypergraphs
Combinatorics
2015-03-24 v1
Abstract
The size-Ramsey number of a graph is the minimum number of edges in a graph such that every 2-edge-coloring of yields a monochromatic copy of . 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 -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.
Keywords
Cite
@article{arxiv.1503.06304,
title = {On the size-Ramsey number of hypergraphs},
author = {Andrzej Dudek and Steven La Fleur and Dhruv Mubayi and Vojtech Rodl},
journal= {arXiv preprint arXiv:1503.06304},
year = {2015}
}