Qizhong Lin

activity

20242026

collaborators

4 papers

math.CO2026

Ramsey lower bounds for bounded degree hypergraphs

Chunchao Fan, Qizhong Lin

We prove that for all $k \geq 3$ and any integers $I^, n$ with $n \geq 2^{I^} ,$ there exists a $k$ -graph on $n$ vertices with maximum degree at most $I^$ such that $r(H)\geq\tw_{k-1}(c…

math.CO2026

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…

math.CO2025

Fan-complete Ramsey numbers

Fan Chung, Qizhong Lin

For graphs $G$ and $H$ , we consider Ramsey numbers $r (G, H)$ with tight lower bounds, namely, $r (G, H) \geq (I ¨ (G) - 1) (∣ H ∣ - 1) + 1,$ where $I ¨ (G)$ denotes the chromatic number of $G$ and…

math.CO2024

Sharp Ramsey thresholds for large books

Qizhong Lin, Ye Wang

For graphs $G$ and $H$ , let $G \to H$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ . Let $G (N, p)$ be the random graph of order $N$ and edge probability…