7 citations · 10 across the 18 of their papers we have counts for
19 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 i…
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 conjectu…
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 the li…
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…
Odd hypergraph Mantel theorems
Jianfeng Hou, Xizhi Liu, Yixiao Zhang +2
A classical result of Sidorenko (1989) shows that the Turán density of every -uniform hypergraph with three edges is bounded from above by . For even , this bound is tig…
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á…
Exact Turán number of the Fano plane in the -norm
Jianfeng Hou, Xizhi Liu, Yixiao Zhang
A classical object in hypergraph Turán theory is the Fano plane , the unique linear -graph on seven vertices with seven edges. The Turán density and exact Turán numb…
Density Hajnal--Szemerédi theorem for cliques of size four
Jianfeng Hou, Caiyun Hu, Xizhi Liu +1
The celebrated Corrádi--Hajnal Theorem~\cite{CH63} and the Hajnal--Szemerédi Theorem~\cite{HS70} determined the exact minimum degree thresholds for a graph on vertices to conta…
Separating hypergraph Turán densities
Hong Liu, Bjarne Schülke, Shuaichao Wang +2
Determining the Turán densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Turán posed this problem in 1941, remai…
On the boundedness of degenerate hypergraphs
Jianfeng Hou, Caiyun Hu, Heng Li +3
We investigate the impact of a high-degree vertex in Turán problems for degenerate hypergraphs (including graphs). We say an -graph is bounded if there exist constants $α, β…
Many vertex-disjoint even cycles of fixed length in a graph
Jianfeng Hou, Caiyun Hu, Heng Li +3
For every integer , we determine the extremal structure of an -vertex graph with at most vertex-disjoint copies of when is sufficiently large and l…
Toward a density Corrádi--Hajnal theorem for degenerate hypergraphs
Jianfeng Hou, Caiyun Hu, Heng Li +3
Given an -graph with , let denote the maximum number of edges in an -vertex -graph with at most pairwise vertex-disjoint copies…
Hypergraphs with irrational Turán density and many extremal configurations
Jianfeng Hou, Heng Li, Guanghui Wang +1
Unlike graphs, determining Turán densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of -uniform hyperg…
A step towards a general density Corrádi--Hajnal Theorem
Jianfeng Hou, Heng Li, Xizhi Liu +2
For a nondegenerate -graph , large , and in the regime , where is a constant depending only on , we present a general approach for determining…
Two stability theorems for -saturated hypergraphs
Jianfeng Hou, Heng Li, Caihong Yang +2
An -saturated -graph is a maximal -graph not containing any member of as a subgraph. Let be the collection of all -…
Generating non-jumps from a known one
Jianfeng Hou, Heng Li, Caihong Yang +1
Let be an integer. The real number is a jump for if there exists a constant such that for any and any integer , there exists an in…
Hypergraphs with infinitely many extremal constructions
Jianfeng Hou, Heng Li, Xizhi Liu +2
We give the first exact and stability results for a hypergraph Turán problem with infinitely many extremal constructions that are far from each other in edit-distance. This include…