Qizhong Lin

activity

20182026

most citedRamsey non-goodness involving books

1 citations · 1 across the 3 of their papers we have counts for

collaborators

7 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 $Δ, n$ with $n \geq 2^{Δ},$ there exists a $k$ -graph on $n$ vertices with maximum degree at most $Δ$ such that $r(H)\geq\tw_{k-1}(c_k…

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.CO2022

Ramsey numbers of large even cycles and fans

Chunlin You, Qizhong Lin

For graphs $F$ and $H$ , the Ramsey number $R (F, H)$ is the smallest positive integer $N$ such that any red/blue edge coloring of $K_{N}$ contains either a red $F$ or a blue $H$ . Let…

math.CO2022★ 1 cited

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…

math.CO2019

Large book--cycle Ramsey numbers

Qizhong Lin, Xing Peng

Let $B_{n}^{(k)}$ be the book graph which consists of $n$ copies of $K_{k + 1}$ all sharing a common $K_{k}$ , and let $C_{m}$ be a cycle of length $m$ . In this paper, we first determine th…

math.CO2018

A note on the size Ramsey number of powers of paths

Chunlin You

Let $r \geq 3$ be an integer such that $r - 2$ is a prime power and let $H$ be a connected graph on $n$ vertices with average degree at least $d$ and $α (H) \leq β n$ , where $0 < β < 1$ is a c…