Lower bounds for Ramsey numbers of bounded degree hypergraphs

Domagoj Bradač, Zach Hunter, Benny Sudakov

We prove that, for all $k\ge 3,$ and any integers $\Delta ,n$ with $n\ge \Delta ,$ there exists a $k$-uniform hypergraph on $n$ vertices with maximum degree at most $\Delta$ whose $4$-color Rams…