Caiyun Hu

activity

20242026

collaborators

8 papers

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

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

A finite-board reduction for the ErdÅs Matching Conjecture and the 4-uniform case via exact certificates

Jianfeng Hou, Caiyun Hu, Xizhi Liu

We prove the 4-uniform ErdÅs Matching Conjecture for every matching number $s \geq 6961$ . The proof has two parts. First, building on ideas from Frankl--RÃ¶dl--RuciÅski, we formula…

math.CO2025

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 $n$ vertices in order to guarantee a rainbow…

math.CO2025

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 $n$ vertices to con…

math.CO2024

Toward a density CorrÃ¡di--Hajnal theorem for degenerate hypergraphs

Jianfeng Hou, Caiyun Hu, Heng Li +3

Given an $r$ -graph $F$ with $r \geq 2$ , let $ex (n, (t + 1) F)$ denote the maximum number of edges in an $n$ -vertex $r$ -graph with at most $t$ pairwise vertex-disjoint copies…

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

Non-trivial Intersection Problems for Multi-partite Hypergraphs

A finite-board reduction for the ErdÅs Matching Conjecture and the 4-uniform case via exact certificates

Toward a rainbow CorrÃ¡di--Hajnal Theorem \RNum{1}

Density Hajnal--SzemerÃ©di theorem for cliques of size four

Toward a density CorrÃ¡di--Hajnal theorem for degenerate hypergraphs

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

Non-trivial Intersection Problems for Multi-partite Hypergraphs

A finite-board reduction for the ErdÅs Matching Conjecture and the 4-uniform case via exact certificates

Toward a rainbow CorrÃ¡di--Hajnal Theorem \RNum{1}

Density Hajnal--SzemerÃ©di theorem for cliques of size four

Toward a density CorrÃ¡di--Hajnal theorem for degenerate hypergraphs

A finite-board reduction for the ErdÅs Matching Conjecture and the 4-uniform case via exact certificates