Heng Li

activity

20222026

most citedHypergraphs with infinitely many extremal constructions

7 citations · 10 across the 20 of their papers we have counts for

collaborators

Showing 2023Show all

4 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

Hypergraphs with irrational Turán density and many extremal configurations

Jianfeng Hou, Heng Li, Guanghui Wang +1

Unlike graphs, determining Turán densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of $r$ -uniform hyperg…

math.CO2023★ 1 cited

A step towards a general density Corrádi--Hajnal Theorem

Jianfeng Hou, Heng Li, Xizhi Liu +2

For a nondegenerate $r$ -graph $F$ , large $n$ , and $t$ in the regime $[0, c_{F} n]$ , where $c_{F} > 0$ is a constant depending only on $F$ , we present a general approach for determining…