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

6 papers · 1 filter

math.CO2022

Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs

Asaf Ferber, Jie Han, Dingjia Mao

Given a family of graphs $G_{1}, \dots, G_{n}$ on the same vertex set $[n]$ , a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_{c}$ contributes exactly one edge. We…

math.CO2022★ 1 cited

Spanning trees in sparse expanders

Jie Han, Donglei Yang

Given integers $n \geq Δ \geq 2$ , let $T (n, Δ)$ be the collection of all $n$ -vertex trees with maximum degree at most $Δ$ . A question of Alon, Krivelevich and Sudakov in 2007…

math.CO2022

Finding matchings in dense hypergraphs

Jie Han, Peter Keevash

We consider the algorithmic decision problem that takes as input an $n$ -vertex $k$ -uniform hypergraph $H$ with minimum codegree at least $m - c$ and decides whether it has a matching…

math.CO2022

$H$ -factors in graphs with small independence number

Ming Chen, Jie Han, Guanghui Wang +1

Let $H$ be an $h$ -vertex graph. The vertex arboricity $a r (H)$ of $H$ is the least integer $r$ such that $V (H)$ can be partitioned into $r$ parts and each part induces a forest in $…

math.CO2022★ 1 cited

Clique-factors in graphs with sublinear $ℓ$ -independence number

Jie Han, Ping Hu, Guanghui Wang +1

Given a graph $G$ and an integer $ℓ \geq 2$ , we denote by $α_{ℓ} (G)$ the maximum size of a $K_{ℓ}$ -free subset of vertices in $V (G)$ . A recent question of Nenadov and Pehova…

math.CO2022

On the Keevash-Knox-Mycroft Conjecture

Luyining Gan, Jie Han

Given $1 \leq ℓ < k$ and $δ \geq 0$ , let $PM (k, ℓ, δ)$ be the decision problem for the existence of perfect matchings in $n$ -vertex $k$ -uniform hypergraphs with minimum $\el…

Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs

Spanning trees in sparse expanders

Finding matchings in dense hypergraphs

H-factors in graphs with small independence number

Clique-factors in graphs with sublinear ℓ-independence number

On the Keevash-Knox-Mycroft Conjecture

$H$ -factors in graphs with small independence number

Clique-factors in graphs with sublinear $ℓ$ -independence number