Wanfang Chen

activity

20242026

collaborators

Showing 2026 · math.COShow all

4 papers · 2 filters

math.CO2026

Turán numbers of $4$ -uniform tight even cycles minus one edge

Wanfang Chen, Jianfeng Hou, Xizhi Liu +2

For every integer $k \geq 1$ and sufficiently large $n$ , we show that the extremal construction for the Turán number of the $4$ -uniform tight cycle of length $4 k + 2$ minus one edge i…

math.CO2026

Exact extremal constructions for the inducibility of blowup graphs

Wanfang Chen, Xizhi Liu

For a finite graph $H$ and a positive integer $h$ , the $h$ -blowup $H^{(h)}$ of $H$ is the graph obtained by replacing each vertex of $H$ by a set of size $h$ and each edge by a com…

math.CO2026

Vertex-colored Turán theorems with applications in extremal hypergraph problems

Wanfang Chen, Jinghua Deng, Jianfeng Hou +2

Balogh, Clemen, and Lidický proved that the $ℓ_{2}$ -norm Turán problem for $K_{5}^{3}$ is asymptotically solved by the balanced bipartite construction, and they further conjectu…

math.CO2026

The maximum number of triangles in graphs without vertex disjoint friendship graphs

Wanfang Chen, Jia-Bao Yang, Leilei Zhang

Given graphs $H$ and $F$ , the generalized Turán number $ex (n, H, F)$ is the maximum number of copies of $H$ among all $n$ -vertex $F$ -free graphs. The friendship graph $F_{k}$ …

Turán numbers of 4-uniform tight even cycles minus one edge

Exact extremal constructions for the inducibility of blowup graphs

Vertex-colored Turán theorems with applications in extremal hypergraph problems

The maximum number of triangles in graphs without vertex disjoint friendship graphs

Turán numbers of $4$ -uniform tight even cycles minus one edge