Chunlin You

activity

20182026

most citedA note on the size Ramsey number of powers of paths

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

collaborators

8 papers

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

Towards a conjecture on degree conditions for Ramsey goodness of paths

Chunlin You

Recently, Aragão, Marciano, and Mendonça [\emph{European J. Combin.}, 2025] conjectured that for any graph $G$ on $n$ vertices satisfying $(r - 1) (t - 1) k < n \leq (r - 1) (t - 1) (k + 1)$ , the…

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

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