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 2015Show all

6 papers · 1 filter

math.CO2015★ 1 cited

Perfect Matchings in Hypergraphs and the Erdős matching conjecture

Jie Han

We prove a new upper bound for the minimum $d$ -degree threshold for perfect matchings in $k$ -uniform hypergraphs when $d < k /2$ . As a consequence, this determines exact values of the…

math.CO2015★ 27 cited

The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family

Jie Han, Yoshiharu Kohayakawa

The celebrated Erdős-Ko-Rado theorem determines the maximum size of a $k$ -uniform intersecting family. The Hilton-Milner theorem determines the maximum size of a $k$ -uniform inters…

math.CO2015★ 1 cited

Forbidding Hamilton cycles in uniform hypergraphs

Jie Han, Yi Zhao

For $1 \leq d \leq ℓ < k$ , we give a new lower bound for the minimum $d$ -degree threshold that guarantees a Hamilton $ℓ$ -cycle in $k$ -uniform hypergraphs. When $k \geq 4$ and $d< \e…

math.CO2015★ 3 cited

Minimum codegree threshold for $C_{6}^{3}$ -factors in $3$ -uniform Hypergraphs

Wei Gao, Jie Han

Let $C_{6}^{3}$ be the 3-uniform hypergraph on ${1, \dots, 6}$ with edges $123, 345, 561$ , which can be seen as the triangle in 3-uniform hypergraphs. For sufficiently large $n$ divisi…

math.CO2015★ 10 cited

Near Perfect Matchings in $k$ -uniform Hypergraphs II

Jie Han

Suppose $k ∤ n$ and $H$ is an $n$ -vertex $k$ -uniform hypergraph. A near perfect matching in $H$ is a matching of size $⌊ n / k ⌋$ . We give a divisibility barrier constr…

math.CO2015★ 31 cited

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Jie Han, Chuanyun Zang, Yi Zhao

Given positive integers $a \leq b \leq c$ , let $K_{a, b, c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a, b, c$ . Let $H$ be a 3-uniform hypergraph on $n$ …

Perfect Matchings in Hypergraphs and the Erdős matching conjecture

The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family

Forbidding Hamilton cycles in uniform hypergraphs

Minimum codegree threshold for C63​-factors in 3-uniform Hypergraphs

Near Perfect Matchings in k-uniform Hypergraphs II

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Minimum codegree threshold for $C_{6}^{3}$ -factors in $3$ -uniform Hypergraphs

Near Perfect Matchings in $k$ -uniform Hypergraphs II