On Tight Tree‐Complete Hypergraph Ramsey Numbers
Abstract
ABSTRACT Chvátal showed that for any tree with edges, the Ramsey number . For or 4, we show that, if is an ‐uniform nontrivial tight tree, then the hypergraph Ramsey number . The 3‐uniform result comes from observing a construction of Cooper and Mubayi. The main contribution of this paper is the 4‐uniform construction, which is inspired by the Cooper–Mubayi 3‐uniform construction.
Fields of Study & Subjects
Advanced Topology and Set Theory
Computability
Logic
AI Algorithms
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Journal of Graph Theory
- Volume
- 113
- Issue
- 1
- Pages
- 88–96
- Publication date
- 28 April 2026
- Language
- EN