8 papers
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 step towards the Ramsey-Turán conjecture for and
Xinyu Hu, Qizhong Lin
Ramsey-Turán type problems were initiated by ErdÅs and Sós in 1969. Given integers , a graph is -free if there exists a red/blue edge coloring of su…
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 in…
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…