activity
20242026
collaborators

7 papers

math.CO2026

A double-exponential lower bound for

Longma Du, Xinyu Hu, Ruilong Liu +1

The Ramsey number is the smallest integer such that every -vertex -graph contains either a copy of or an independent set of size . We prove that…

math.CO2026

A Note on Generalized Erdős-Rogers Problems

Longma Du, Xinyu Hu, Ruilong Liu +1

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

math.CO2026

A step towards the Erdős-Rogers problem

Longma Du, Xinyu Hu, Ruilong Liu +1

For , the Erdős-Rogers function denotes the largest such that every -free -graph on vertices contains a -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 . For any integer , an edge coloring of the complete -graph is said to be a -coloring if every copy of 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 . In 1972, Erdős and Hajnal conjectured that the tower growth rate of $r_k(k+…