Wanfang Chen

collaborators

5 papers

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…

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 conjec…

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}$ …

math.CO2025

Tetrahedron Conjecture in the $ℓ_{2}$ -norm

Levente BodnÃ¡r, Wanfang Chen, Jinghua Deng +5

The famous Tetrahedron Conjecture of TurÃ¡n from the 1940s asserts that the number of edges in an $n$ -vertex $3$ -graph without the tetrahedron, the complete $3$ -graph on four verti…

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

Tetrahedron Conjecture in the ℓ2​-norm

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

Tetrahedron Conjecture in the $ℓ_{2}$ -norm