1 citations · 2 across the 7 of their papers we have counts for
7 papers
An improved double-exponential lower bound for
Chunchao Fan, Mingze Li, Qizhong Lin +1
The Ramsey number is the smallest integer such that every -vertex -graph contains either a copy of or an independent set of size . A well-known…
Two-color Ramsey lower bounds for bounded degree hypergraphs
Chunchao Fan, Qizhong Lin
We consider Ramsey numbers of bounded-degree uniform hypergraphs. In particular, we prove that for every , there exists a constant such that, for all sufficiently la…
Asymptotically optimal Ramsey goodness of sparse graphs versus odd cycles and paths
Chunchao Fan, Qizhong Lin
A fundamental problem in graph Ramsey theory is to determine, for sparse graphs on vertices, the minimal such that is Ramsey-good for odd cycles and paths $P_…
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+…
On a conjecture of Conlon, Fox and Wigderson
Chunchao Fan, Qizhong Lin, Yuanhui Yan
For graphs and , the Ramsey number is the smallest positive integer such that any red/blue edge coloring of the complete graph contains either a red o…
Fan-complete Ramsey numbers
Fan Chung, Qizhong Lin
For graphs and , we consider Ramsey numbers with tight lower bounds, namely, where denotes the chromatic number of and $…
Ramsey non-goodness involving books
Chunchao Fan, Qizhong Lin
In 1983, Burr and Erdős initiated the study of Ramsey goodness problems.Nikiforov and Rousseau (2009) resolved almost all goodness questions raised by Burr and Erdős, in which the…