Xing Peng

activity

20242026

most citedThe number of edges in graphs with bounded clique number and circumference

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

collaborators

4 papers

math.CO2026

Counting triangles in graphs without suspensions of paths

Chunyang Dou, Xing Peng

For a graph $H$ , the suspension $H$ of $H$ is a graph obtained from $H$ by joining a new vertex to every vertex of $H$ . The generalized Turán number $\textrm{ex}(n,K_3,\wi…

math.CO2025

The Ramsey number of the 4-cycle versus a book graph

Chunyang Dou, Tianyu Li, Qizhong Lin +1

Given positive integers $n$ and $k$ , the book graph $B_{n}^{(k)}$ consists of $n$ copies of $K_{k + 1}$ sharing a common $K_{k}$ . The book graph is a common generalization of a star and…

math.CO2024

Turán numbers of cycles plus a general graph

Chunyang Dou, Fu-tao Hu, Xing Peng

For a family of graphs $F$ , a graph $G$ is $F$ -free if it does not contain a member of $F$ as a subgraph. The Turán number $ex (n, F)$ is the maximum n…

math.CO2024★ 1 cited

The number of edges in graphs with bounded clique number and circumference

Chunyang Dou, Bo Ning, Xing Peng

Let $H$ be a family of graphs. The Turán number $ex (n, H)$ is the maximum possible number of edges in an $n$ -vertex graph which does not contain any member of $\ca…