4 papers
The asymptotics of off-diagonal book Ramsey numbers
Lulu Dai, Chunchao Fan, Qizhong Lin
Let be the book graph consisting of triangles sharing a common edge. We prove upper bounds for that asymptotically match the known lower bound…
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\)-…
Book Ramsey numbers via algebraic constructions
Lulu Dai, Qizhong Lin
Let \(B_n\) denote the book graph consisting of \(n\) triangles sharing a common edge. Rousseau and Sheehan (1978) proved, using Paley graphs, that \(R(B_n,B_n)=4n+2\) whenever \(4…
Ramsey numbers of K_s + mK_t versus K_n
Lulu Dai, Qizhong Lin
For integers m >= 1, s >= 0, and t >= 1, let K_s + mK_t denote the join of a clique K_s and m vertex-disjoint copies of K_t. We prove that for fixed m >= 1, t >= 1, and s >= 0, R(K…