Xinyu Hu

activity

20222026

most citedTwo Ramsey-Turán numbers involving triangles

1 citations · 1 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2026

The Erdős--Hajnal hypergraph Ramsey problem for $r_{4} (6, 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$ . Erdős and Haj…

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…

math.CO2026

Spectral bounds for the independence number of graphs and even uniform hypergraphs

Xinyu Hu, Jiang Zhou, Changjiang Bu

In this paper, we give spectral upper bounds for the independence number of even uniform hypergraphs and graphs, extend the Hoffman bound to even uniform hypergraphs, and give a si…

math.CO2025

Phase transitions of the Erdős-Gyárfás function

Xinyu Hu, Qizhong Lin, Xin Lu +1

Given positive integers $p, q$ . For any integer $k \geq 2$ , an edge coloring of the complete $k$ -graph $K_{n}^{(k)}$ is said to be a $(p, q)$ -coloring if every copy of $K_{p}^{(k)}$ receive…

math.CO2024

New bounds of two hypergraph Ramsey problems

Chunchao Fan, Xinyu Hu, Qizhong Lin +1

We focus on two hypergraph Ramsey problems. First, we consider the Erdős-Hajnal function $r_{k} (k + 1, t; n)$ . In 1972, Erdős and Hajnal conjectured that the tower growth rate of $r_k(k+…

math.CO2024

A step towards the Ramsey-Turán conjecture for $K_{3}$ and $K_{6}$

Xinyu Hu, Qizhong Lin

Ramsey-Turán type problems were initiated by Erdős and Sós in 1969. Given integers $p, q \geq 2$ , a graph $G$ is $(K_{p}, K_{q})$ -free if there exists a red/blue edge coloring of $G$ such…

math.CO2022★ 1 cited

Two Ramsey-Turán numbers involving triangles

Xinyu Hu, Qizhong Lin

Given integers $p, q \geq 2$ , we say that a graph $G$ is $(K_{p}, K_{q})$ -free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_{p}$ nor a blue $K_{q}$ . F…

The Erdős--Hajnal hypergraph Ramsey problem for r4​(6,n)

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

Spectral bounds for the independence number of graphs and even uniform hypergraphs

Phase transitions of the Erdős-Gyárfás function

New bounds of two hypergraph Ramsey problems

A step towards the Ramsey-Turán conjecture for K3​ and K6​

Two Ramsey-Turán numbers involving triangles

The Erdős--Hajnal hypergraph Ramsey problem for $r_{4} (6, n)$

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

A step towards the Ramsey-Turán conjecture for $K_{3}$ and $K_{6}$