An improved double-exponential lower bound for $r_4(5,n)$

TL;DR

This paper improves the lower bound for the Ramsey number r_4(5,n) from a double-exponential of n^{1/7} to n^{1/5}, advancing understanding of hypergraph Ramsey theory.

Contribution

It refines previous constructions to achieve a stronger double-exponential lower bound for r_4(5,n), reducing the layers in the greedy selection process.

Findings

Established a new lower bound of 2^{2^{ ext{Omega}(n^{1/5})}} for r_4(5,n)

Modified the construction to reduce layers from seven to five

Progressed towards the Erdős-Hajnal conjecture for hypergraph Ramsey numbers

Abstract

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed $4\le k<s$, $r_k(s,n)\ge \operatorname{twr}_{k-1}(\Omega(n)).$ At present, only the last two cases of this conjecture remain open, namely $r_4(5,n)\ge2^{2^{\Omega(n)}}$ and $r_4(6,n)\ge2^{2^{\Omega(n)}}$. Recently, Du, Hu, Liu, and Wang achieved a breakthrough by proving $r_4(5,n)\ge 2^{2^{\Omega(n^{1/7})}}$, which is the first double-exponential lower bound for $r_4(5,n)$. In this note, we improve this to $2^{2^{\Omega(n^{1/5})}}$ by modifying their construction and reducing the greedy selection of local maxima from seven layers to five, thereby making further progress towards the Erd\H{o}s-Hajnal conjecture.