Xing Peng

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Counting triangles in graphs with no wheels of order at least five

Chunyang Dou, Bo Ning, Xing Peng

For a family of graphs $F$ , a graph $G$ is said to be $F$ -free if it contains no member of $F$ as a subgraph. A wheel graph $W_{k}$ is a graph on $k + 1$ ver…

math.CO2024

TurÃ¡n number of the odd-ballooning of complete bipartite graphs

Xing Peng, Mengjie Xia

Given a graph $L$ , the TurÃ¡n number $ex (n, L)$ is the maximum possible number of edges in an $n$ -vertex $L$ -free graph. The study of TurÃ¡n number of graphs is a central t…