1 citations · 1 across the 10 of their papers we have counts for
6 papers · 1 filter
The Erdős--Hajnal hypergraph Ramsey problem 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 . Erdős and Haj…
New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers
Hanzhi Bai, Longma Du, Xinyu Hu +2
The Ramsey number is the smallest such that any red/blue coloring of the -subsets of contains a red -set or a blue -set. For fixed and , and fo…
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…
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^{(…
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…
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…