11 papers
A Higher-Order Clique Density Theorem
Heng Li, Hong Liu, Yixiao Zhang
Reiher's clique density theorem determines the sharp lower envelope for the density of at fixed edge density. We prove a higher-order version in which the prescribed quantity…
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…
On a hypergraph Turán problem of Balogh-Bohman-Bollobás-Zhao
Heng Li, Jie Ma, Tianhen Wang +2
Let and be disjoint sets with and for , and let be the -graph on whose edges are the -subsets containing or…
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 conjec…
A note on the -partite link problem of Füredi
Jianfeng Hou, Xinmin Hou, Xizhi Liu +2
Motivated by the ErdÅs--Sós bipartite link conjecture, Füredi (Oberwolfach, 2004) asked for the asymptotic maximum edge density of -graphs in which th…
On a refinement of the Ahlswede--Katona Theorem
Jianfeng Hou, Xizhi Liu, Yixiao Zhang
A classical theorem of Ahlswede and Katona determines the maximum density of the -edge star in a graph with a given edge density. Motivated by its application in hypergraph TurÃ…