Jia-Sheng Zeng

collaborators

6 papers

math.CO2026

Polynomial positivity cones for Coxeter roots and walks in trees

Dongxiu Cai, Zhenbo Chen, Jiasheng Zeng +1

For a finite simple graph $G$ and an integer $k \geq 0$ , let $w_{k} (G)$ denote the number of walks of length $k$ . We prove the conjecture of Täubig, Weihmann, Kosub, Hemmecke, and Mayr…

math.CO2026

Hypergraph Turan with bounded matching number

Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang

For a fixed graph $G$ , an $r$ -uniform hypergraph is said to contain a Berge- $G$ if there exists a bijection $f : E (G) \to E (H)$ for some subhypergraph $H$ su…

math.CO2026

Paths of Odd Order in Graphs with Given Edge Density

Yuyao Yang, Jiasheng Zeng

We determine the asymptotic maximum number of unlabelled copies of $P_{2 r + 1}$ in graphs with prescribed edge density, where $r \geq 1$ is fixed and $P_{2 r + 1}$ denotes the path on $2r+…

math.CO2025

A hypergraph analogue of Alon-Frankl Theorem

Caihong Yang, Jiasheng Zeng, Xiao-Dong Zhang

Recently, Alon and Frankl (JCTB, 2024) determined the maximum number of edges in $K_{ℓ + 1}$ -free $n$ -vertex graphs with bounded matching number. For integers $ℓ \geq r \geq 2$ , t…

math.CO2025

Generalized Turán results for disjoint copies of degenerate graphs

Caihong Yang, Jiasheng Zeng

The generalized Turán number $ex (n, H, F)$ denotes the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. For an integer $t \geq 1$ , let $tF$ be the vertex-d…

math.CO2025

Generalized Turan number with given size

Yan Wang, Yue Xu, Jiasheng Zeng +1

Generalized Turán problem with given size, denoted as $mex (m, K_{r}, F)$ , determines the maximum number of $K_{r}$ -copies in an $F$ -free graph with $m$ edges. We prove that for…