Caihong Yang

collaborators

3 papers

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…

math.CO2024

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 $r$ -graph $F$ is bounded if there exist constants $Î±,…

math.CO2024

Tight bounds for rainbow partial $F$ -tiling in edge-colored complete hypergraphs

Jinghua Deng, Jianfeng Hou, Xizhi Liu +1

For an $r$ -graph $F$ and integers $n, t$ satisfying $t \leq n / v (F)$ , let $ar (n, tF)$ denote the minimum integer $N$ such that every edge-coloring of $K_{n}^{r}$ using $N$ col…

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

On the boundedness of degenerate hypergraphs

Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs

Tight bounds for rainbow partial $F$ -tiling in edge-colored complete hypergraphs