We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On the Size-Ramsey Number of Hypergraphs.
- Authors
Dudek, Andrzej; Fleur, Steven La; Mubayi, Dhruv; Rödl, Vojtech
- Abstract
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 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.
- Subjects
GRAPH grammars; RAMSEY numbers; HYPERGRAPHS; MONOCHROMATIC aberration; EDGES (Geometry)
- Publication
Journal of Graph Theory, 2017, Vol 86, Issue 1, p104
- ISSN
0364-9024
- Publication type
Article
- DOI
10.1002/jgt.22115