Jie Han

most citedNear Perfect Matchings in

k

-uniform Hypergraphs

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2016★ 7 cited

The complexity of perfect matchings and packings in dense hypergraphs

Jie Han, Andrew Treglown

Given two $k$ -graphs $H$ and $F$ , a perfect $F$ -packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$ . In the case whe…

math.CO2014★ 27 cited

Near Perfect Matchings in $k$ -uniform Hypergraphs

Jie Han

Let $H$ be a $k$ -uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$ . We prove that if the minimum $(k - 1)$ -degree of $H$ is at least $…

The complexity of perfect matchings and packings in dense hypergraphs

Near Perfect Matchings in k-uniform Hypergraphs

Near Perfect Matchings in $k$ -uniform Hypergraphs