1 citations · 2 across the 34 of their papers we have counts for
5 papers · 1 filter
Generalized Andrásfai--Erdős--Sós theorems for odd cycles
Zian Chen, Jianfeng Hou, Caiyun Hu +1
In this note, we establish Andrásfai--Erdős--Sós-type stability theorems for two generalized Turán problems involving odd cycles, both of which are extensions of the Erdős Pentagon…
Balanced clique subdivisions and cycles lengths in -free graphs
Jianfeng Hou, Yindong Jin, Donglei Yang +1
Let be integers. Confirming a conjecture of Mader, Liu and Montgomery [J. Lond. Math. Soc., 2017] showed that every -free graph with average degree cont…
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 $α, β…
Tight bounds for rainbow partial -tiling in edge-colored complete hypergraphs
Jinghua Deng, Jianfeng Hou, Xizhi Liu +1
For an -graph and integers satisfying , let denote the minimum integer such that every edge-coloring of using col…
A criterion for Andrásfai--Erdős--Sós type theorems and applications
Jianfeng Hou, Xizhi Liu, Hongbin Zhao
The classical Andrásfai--Erdős--Sós Theorem states that for , every -vertex -free graph with minimum degree greater than must b…