7 papers · 1 filter
Turán numbers of -uniform tight even cycles minus one edge
Wanfang Chen, Jianfeng Hou, Xizhi Liu +2
For every integer and sufficiently large , we show that the extremal construction for the Turán number of the -uniform tight cycle of length minus one edge i…
Exact extremal constructions for the inducibility of blowup graphs
Wanfang Chen, Xizhi Liu
For a finite graph and a positive integer , the -blowup of is the graph obtained by replacing each vertex of by a set of size and each edge by a com…
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 -norm Turán problem for is asymptotically solved by the balanced bipartite construction, and they further conjectu…
The maximum number of triangles in graphs without vertex disjoint friendship graphs
Wanfang Chen, Jia-Bao Yang, Leilei Zhang
Given graphs and , the generalized Turán number is the maximum number of copies of among all -vertex -free graphs. The friendship graph …
Tetrahedron Conjecture in the -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 -vertex -graph without the tetrahedron, the complete -graph on four vertic…
Nondegenerate Turán problems under -norms
Wanfang Chen, Daniel Iľkovič, Jared León +2
Given integers and a real number , the -norm of an -graph is the sum of the -th power o…