TL;DR
This paper establishes that the 2-color Ramsey numbers for Berge cliques in hypergraphs grow linearly with the size of the clique, providing exact values for various uniformities and exploring related hypergraph structures.
Contribution
It proves the linearity of the 2-color Ramsey number for Berge cliques and determines exact values for specific uniformities and sizes, advancing understanding of hypergraph Ramsey theory.
Findings
The 2-color Ramsey number of Berge cliques is linear.
Exact values of Ramsey numbers for Berge-$K_s$ in 3-uniform hypergraphs.
Ramsey numbers for higher uniformity Berge cliques are determined.
Abstract
For a graph , a hypergraph is called a Berge-, denoted by , if there exists a bijection such that for every , . Let the Ramsey number be the smallest integer such that for any -edge-coloring of a complete -uniform hypergraph on vertices, there is a monochromatic Berge- subhypergraph. In this paper, we show that the 2-color Ramsey number of Berge cliques is linear. In particular, we show that for and where is a Berge- hypergraph. For higher uniformity, we show that for and for and sufficiently large. We also investigate the Ramsey number of trace hypergraphs, suspension hypergraphs and expansion hypergraphs.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
