Caiyun Hu

activity

20232026

most citedOn the boundedness of degenerate hypergraphs

1 citations · 2 across the 9 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

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…

math.CO2026

Explicit thresholds in a generalized Turán problem for $K_{3,t}$-free graphs

Jianfeng Hou, Caiyun Hu, Hezhi Wang

For graphs $F$ and $H$ , let $\ex(n,F,H)$ denote the maximum number of copies of $F$ in an $n$ -vertex $H$ -free graph. Janzer, Longbrake and Yepremyan recently proved that, for fixed…

math.CO2026

The Erdős Matching Conjecture for 4-uniform hypergraphs

Jianfeng Hou, Caiyun Hu, Xizhi Liu

We prove the Erdős Matching Conjecture for $4$ -uniform hypergraphs for every matching number $s \geq 6004$ . Specifically, for integers $s \geq 6004$ and $n \geq 4 s + 4$ , if a $n$ -vertex 4-u…

Non-trivial Intersection Problems for Multi-partite Hypergraphs

Explicit thresholds in a generalized Turán problem for \(K_{3,t}\)-free graphs

The Erdős Matching Conjecture for 4-uniform hypergraphs