Jianfeng Hou

activity

20232026

most citedToward a density Corrádi--Hajnal theorem for degenerate hypergraphs

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

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Many vertex-disjoint even cycles of fixed length in a graph

Jianfeng Hou, Caiyun Hu, Heng Li +3

For every integer $k \geq 3$ , we determine the extremal structure of an $n$ -vertex graph with at most $t$ vertex-disjoint copies of $C_{2 k}$ when $n$ is sufficiently large and $t$ l…

math.CO2023★ 1 cited

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.CO2023

Counting triangles in graphs without vertex disjoint odd cycles

Jianfeng Hou, Caihong Yang, Qinghou Zeng

Given two graphs $H$ and $F$ , the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices is denoted by $ex (n, H, F)$ . Let $(ℓ + 1) \cdot F$ denote…