R. Liu

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

Hanzhi Bai, Longma Du, Xinyu Hu +2

The Ramsey number $r_{k} (s, m)$ is the smallest $N$ such that any red/blue coloring of the $k$ -subsets of $[N]$ contains a red $s$ -set or a blue $m$ -set. For fixed $k$ and $s$ , and fo…

math.CO2026

A double-exponential lower bound for $r_{4} (5, n)$

Longma Du, Xinyu Hu, Ruilong Liu +1

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$ . We prove that…

math.CO2026

A Note on Generalized Erdős-Rogers Problems

Longma Du, Xinyu Hu, Ruilong Liu +1

For a $k$ -uniform hypergraph $F$ and positive integers $s$ and $N$ , the generalized Erdős-Rogers function $f_{F, s}^{(k)} (N)$ denotes the largest integer $m$ such that every $K_s^{(…

math.CO2026

A step towards the Erdős-Rogers problem

Longma Du, Xinyu Hu, Ruilong Liu +1

For $2 \leq k \leq t < s$ , the Erdős-Rogers function $f_{t, s}^{(k)} (N)$ denotes the largest $m$ such that every $K_{s}^{(k)}$ -free $k$ -graph on $N$ vertices contains a $K_{t}^{(k)}$ -free ind…

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

A double-exponential lower bound for r4​(5,n)

A Note on Generalized Erdős-Rogers Problems

A step towards the Erdős-Rogers problem

A double-exponential lower bound for $r_{4} (5, n)$