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

4 papers · 1 filter

math.CO2016★ 6 cited

Codegree conditions for tiling complete $k$ -partite $k$ -graphs and loose cycles

Wei Gao, Jie Han, Yi Zhao

Given two $k$ -graphs ( $k$ -uniform hypergraphs) $F$ and $H$ , a perfect $F$ -tiling (or an $F$ -factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex…

math.CO2016★ 4 cited

Matchings in $k$ -partite $k$ -uniform Hypergraphs

Jie Han, Chuanyun Zang, Yi Zhao

For $k \geq 3$ and $ε > 0$ , let $H$ be a $k$ -partite $k$ -graph with parts $V_{1}, \dots, V_{k}$ each of size $n$ , where $n$ is sufficiently large. Assume that for each $i \in [k]$ , every $(k…

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.CO2016★ 3 cited

Two-regular subgraphs of odd-uniform hypergraphs

Jie Han, Jaehoon Kim

Let $k \geq 3$ be an odd integer and let $n$ be a sufficiently large integer. We prove that the maximum number of edges in an $n$ -vertex $k$ -uniform hypergraph containing no $2$ -regu…

Codegree conditions for tiling complete k-partite k-graphs and loose cycles

Matchings in k-partite k-uniform Hypergraphs

The complexity of perfect matchings and packings in dense hypergraphs

Two-regular subgraphs of odd-uniform hypergraphs

Codegree conditions for tiling complete $k$ -partite $k$ -graphs and loose cycles

Matchings in $k$ -partite $k$ -uniform Hypergraphs