The girth Ramsey theorem
Christian Reiher, Vojt\v{e}ch R\"odl

TL;DR
This paper proves the existence of hypergraphs with large girth that satisfy Ramsey properties for given hypergraphs and colorings, including constructions that locally resemble forests of copies of the original hypergraph.
Contribution
It establishes the girth Ramsey theorem for hypergraphs, demonstrating the existence of hypergraphs with specified girth and Ramsey properties, including local forest-like structures.
Findings
Existence of hypergraphs with large girth satisfying Ramsey properties
Construction of hypergraphs locally resembling forests of a given hypergraph
Generalization of Ramsey theory to hypergraphs with girth constraints
Abstract
Given a hypergraph and a number of colours , there exists a hypergraph of the same girth satisfying . Moreover, for every linear hypergraph there exists a Ramsey hypergraph that locally looks like a forest of copies of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory
