4 papers
Tight connectivity and shadow densities in generalized Erdős--Rogers problems
Lulu Dai, Qizhong Lin
Let \(F\) and \(G\) be \(r\)-uniform hypergraphs, and let \(f_{F,G}(n)\) be the largest integer \(m\) such that every \(n\)-vertex \(G\)-free \(r\)-graph contains an induced \(F\)-…
Sharper Ramsey lower bounds from refined Gaussian estimates
Qizhong Lin, Lin Niu
Recently, Ma, Shen and Xie broke the Erdős barrier for off-diagonal Ramsey numbers , achieving the first exponential improvement over the classical lower bound for e…
Book Ramsey numbers via algebraic constructions
Lulu Dai, Qizhong Lin
Let denote the book graph consisting of triangles sharing a common edge. Few exact values of have been obtained since Rousseau and Sheehan (1978) proved, usi…
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…