Papers › Ramsey numbers of Berge-hypergraphs and related structures
Ramsey numbers of Berge-hypergraphs and related structures
Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Zamora
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
For a graph G=(V,E), a hypergraph ℋ is called a Berge-G, denoted by BG, if there exists a bijection f: E(G) →E(ℋ) such that for every e ∈E(G), e ⊆f(e). Let the Ramsey number Rʳ(BG,BG) be the smallest integer n such that for any $2$-edge-coloring of a complete r-uniform hypergraph on n vertices, there is a monochromatic Berge-G subhypergraph. In this paper, we show that the 2-color Ramsey number of Berge cliques is linear. In particular, we show that R³(BKₛ, BKₜ) = s+t-3 for s,t ≥4 and max(s,t) ≥5 where BKₙ is a Berge-Kₙ hypergraph. For higher uniformity, we show that R⁴(BKₜ, BKₜ) = t+1 for t≥6 and Rᵏ(BKₜ, BKₜ)=t for k ≥5 and t sufficiently large. We also investigate the Ramsey number of trace hypergraphs, suspension hypergraphs and expansion hypergraphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections