Junpeng Zhou

collaborators

3 papers

math.CO2026

Counterexamples to a treewidth conjecture on generalized Turán problems

Junpeng Zhou, Xiying Yuan

Given graphs $H$ and $F$ , the generalized Turán number $ex (n, H, F)$ is the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. Alon and Shikhelman (J. Combin. The…

math.CO2026

Counting large cliques in graphs with a forbidden tree

Junpeng Zhou, Xiying Yuan

Given graphs $H$ and $F$ , the generalized Turán number $ex (n, H, F)$ is the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. Alon and Shikhelman (J. Combin. The…

math.CO2026

A Spectral Confirmation of the Erdős Matching Conjecture

Liying Kang, Yongchun Lu, Xiying Yuan +1

The Erdős Matching Conjecture concerns the maximum number of hyperedges in an $r$ -uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart of…