7 papers
A sharp density bound for 5-connected graphs with no $\Ke$ minor
Caibing Chang, Zijian Deng, Qinfei Tang +1
Let $\Ke$ be obtained from by deleting two independent edges. We prove that every 5-connected graph on vertices with at least edges contains a $\Ke$ minor, set…
Layer barriers for colour-biased tight Hamilton cycles
Zijian Deng, Qinfei Tang, Caihong Yang
We construct a family of layer barriers for colour-biased tight Hamilton cycles in uniform hypergraphs. For every and every , we give a red--blue col…
The Turán number of the Cartesian product of trees via star-flip
Lanchao Wang, Caihong Yang
Motivated by Erdős's conjecture on the Turán number of degenerate bipartite graphs, Bradač, Janzer, Sudakov and Tomon proved that $ \ex(n,T \Box P)=Θ_{T,P}(n^{3/2})$ for every nont…
A hypergraph analogue of Alon-Frankl Theorem
Caihong Yang, Jiasheng Zeng, Xiao-Dong Zhang
Recently, Alon and Frankl (JCTB, 2024) determined the maximum number of edges in -free -vertex graphs with bounded matching number. For integers , t…
Triple systems with bounded matching number: some constructions and exact Turán number
Nannan Chen, Miao Liu, Yuzhen Qi +1
We study the Turán numbers of -graphs avoiding -graphs and , a matching of size . We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journa…
Generalized Turán results for disjoint copies of degenerate graphs
Caihong Yang, Jiasheng Zeng
The generalized Turán number denotes the maximum number of copies of in an -vertex -free graph. For an integer , let be the vertex-d…
Exact Turán densities in triple systems
Nannan Chen, Yuzhen Qi, Caihong Yang +1
In this paper, we prove several new Turán density results for -graphs. We show: , ,…