Qizhong Lin

activity

20142026

most citedTwo Ramsey-Turán numbers involving triangles

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

collaborators

Showing math.COShow all

18 papers · 1 filter

math.CO2026

Ordered matchings versus triangles via pseudorandom triangle-free graphs

Wen Chen, Qizhong Lin, Chunlin You

For ordered graphs $H_{1}, \dots, H_{t}$ , let $\rt(H_1,\ldots,H_t)$ denote the least integer $N$ such that every $t$ -coloring of the edges of the naturally ordered complete graph on $[N…

math.CO2026

The Ramsey threshold for trees versus odd cycles

Qizhong Lin, Chunlin You

A longstanding fundamental problem of Burr, Erdős, Faudree, Rousseau and Schelp (\emph{Trans. Amer. Math. Soc.}, 1982) is to determine the exact value of the least integer $f (m)$ ,…

math.CO2026

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 $k \geq 3$ , there exists a constant $c_{k} > 0$ such that, for all sufficiently la…

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

On a conjecture of Conlon, Fox and Wigderson

Chunchao Fan, Qizhong Lin, Yuanhui Yan

For graphs $G$ and $H$ , the Ramsey number $r (G, H)$ is the smallest positive integer $N$ such that any red/blue edge coloring of the complete graph $K_{N}$ contains either a red $G$ o…

math.CO2023

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…

math.CO2022★ 1 cited

Two Ramsey-Turán numbers involving triangles

Xinyu Hu, Qizhong Lin

Given integers $p, q \geq 2$ , we say that a graph $G$ is $(K_{p}, K_{q})$ -free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_{p}$ nor a blue $K_{q}$ . F…

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

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 (χ (G) - 1) (∣ H ∣ - 1) + 1,$ where $χ (G)$ denotes the chromatic number of $G$ and $…

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

Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth

Chunlin You, Qizhong Lin

A graph $H = (W, E_{H})$ is said to have {\em bandwidth} at most $b$ if there exists a labeling of $W$ as $w_{1}, w_{2}, \dots, w_{n}$ such that $∣ i - j ∣ \leq b$ for every edge…

math.CO2021

Ramsey numbers of large books

Xun Chen, Qizhong Lin, Chunlin You

A book $B_{n}$ is a graph which consists of $n$ triangles sharing a common edge. In 1978, Rousseau and Sheehan conjectured that the Ramsey number satisfies $r (B_{m}, B_{n}) \leq 2 (m + n) + c$ f…

math.CO2019★ 1 cited

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★ 1 cited

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…

math.CO2018

Cycle Ramsey numbers for random graphs

Meng Liu, Yusheng Li, Qizhong Lin +1

Let $C_{n}$ be a cycle of length $n$ . As an application of Szemerédi's regularity lemma, Łuczak ( $R (C_{n}, C_{n}, C_{n}) \leq (4 + o (1)) n$ , J. Combin. Theory Ser. B, 75 (1999), 174--187) in f…

math.CO2015

New upper bound for multicolor Ramsey number of odd cycles

Qizhong Lin, Weiji Chen

Let $r_{k} (C_{2 m + 1})$ be the $k$ -color Ramsey number of an odd cycle $C_{2 m + 1}$ of length $2 m + 1$ . It is shown that for each fixed $m \geq 2$ , \[r_k(C_{2m+1})<c^{k}\sqrt{k!}\] for all su…

math.CO2014

Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees

Qizhong Lin, Yusheng Li

For graphs $G$ and $H$ , let $G \to (H, H)$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ as a subgraph, and $H (Δ, n) = {H : ∣ V (H) ∣ = n, Δ (H) \leq Δ}$ .…

math.CO2014

A Folkman Linear Family

Qizhong Lin, Yusheng Li

For graphs $F$ and $G$ , let $F \to (G, G)$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$ . Define Folkman number $f (G; p)$ to be the smallest order of a g…