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

Showing 2024Show all

2 papers · 1 filter

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…