1 citations · 2 across the 9 of their papers we have counts for
9 papers · 1 filter
Non-trivial Intersection Problems for Multi-partite Hypergraphs
Jianfeng Hou, Caiyun Hu
We study non-trivial intersection problems for multi-partite hypergraphs, excluding the usual extremal examples determined by fixed vertices or fixed coordinates. Our first result…
Explicit thresholds in a generalized Turán problem for \(K_{3,t}\)-free graphs
Jianfeng Hou, Caiyun Hu, Hezhi Wang
For graphs and , let $\ex(n,F,H)$ denote the maximum number of copies of in an -vertex -free graph. Janzer, Longbrake and Yepremyan recently proved that, for fixed…
The Erdős Matching Conjecture for 4-uniform hypergraphs
Jianfeng Hou, Caiyun Hu, Xizhi Liu
We prove the Erdős Matching Conjecture for -uniform hypergraphs for every matching number . Specifically, for integers and , if a -vertex 4-u…
Toward a rainbow Corrádi--Hajnal Theorem \RNum{1}
Deng Jinghua, Hou Jianfeng, Hu caiyun +1
We study an anti-Ramsey extension of the classical Corrádi--Hajnal Theorem: how many colors are needed to color the complete graph on vertices in order to guarantee a rainbow c…
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…
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…
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…