On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs
Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky

TL;DR
This paper advances bounds on multicolour hypergraph Ramsey numbers and explores hyperedge colouring constraints related to hypergraph chromatic number, providing new theoretical insights and bounds.
Contribution
It improves lower bounds on multicolour hypergraph Ramsey numbers and establishes bounds on the number of colours needed to colour hyperedges without large monochromatic hyperedges.
Findings
Improved lower bounds on multicolour hypergraph Ramsey numbers.
Derived bounds on colourings avoiding large monochromatic hyperedges.
Established a relationship between the number of colours and hypergraph chromatic number.
Abstract
For and , write if every hyperedge colouring with colours of the complete -uniform hypergraph on vertices has a monochromatic subset of size . Improving upon previous results by \textcite{AGLM14} and \textcite{EHMR84} we show that \[ \text{if } r \geq 3 \text{ and } n \nrightarrow (s)_k^r \text{ then } 2^n \nrightarrow (s+1)_{k+3}^{r+1}. \] This yields an improvement for some of the known lower bounds on multicolour hypergraph Ramsey numbers. Given a hypergraph , we consider the Ramsey-like problem of colouring all -subsets of such that no hyperedge of size is monochromatic. We provide upper and lower bounds on the number of colours necessary in terms of the chromatic number . In particular we show that this number is .
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.
