Jie Han

activity

20122023

most citedMinimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

36 citations · 224 across the 54 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014★ 9 cited

Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs

Jie Han

For any $γ > 0$ , Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$ -vertex $k$ -uniform hypergraph whose mini…

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 $…

Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs

Near Perfect Matchings in k-uniform Hypergraphs

Near Perfect Matchings in $k$ -uniform Hypergraphs