Jie Han

collaborators

5 papers

math.CO2026

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

Jie Han, Hongliang Lu, Bin Wang +1

For fixed integers $k \geq 3$ and $1 \leq d \leq k - 1$ and sufficiently large $n \in k N$ , we establish the sharp minimum $d$ -degree thresholds that forces perfect matching in every…

math.CO2026

Decision problem for Hamilton $2$ -cycles in $4$ -graphs

Luyining Gan, Jie Han, Bin Wang

A $4$ -uniform $2$ -cycle in a $4$ -uniform hypergraph of length $t$ is a cyclic ordering of $2 t$ vertices $v_{1} v_{2} \dots v_{2 t} v_{1}$ such that $v_{2 i + 1} v_{2 i + 2} v_{2 i + 3} v_{2 i + 4}$ are ed…

math.CO2026

Note on the codegree version of the Erdős--Ko--Rado theorem

Luyining Gan, Jie Han, Seonghyuk Im

Kupavskii proved a codegree version of the Erdős--Ko--Rado theorem by showing that for an intersecting family $F \subseteq (k [ n ])$ with $n \geq 2 k + 3 d / (1 - d / k)$ , t…

math.CO2026

The perturbation threshold of degenerate graphs

Jie Han, Seonghyuk Im, Bin Wang +1

We show that for any $d \geq 2$ and $Δ > 0$ there exists $η > 0$ such that the following holds: Let $G$ be an $n$ -vertex graph with at least $Ω (n^{2})$ edges and let $H$ be an $n$ -vertex $…

math.CO2018

Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa +1

For $k \geq 2$ and $r \geq 1$ such that $k + r \geq 4$ , we prove that, for any $α > 0$ , there exists $ε > 0$ such that the union of an $n$ -vertex $k$ -graph with minimum codegree $\left(1-\bino…

Exact Minimum d-Degree Thresholds for Hypergraph Perfect Matchings

Decision problem for Hamilton 2-cycles in 4-graphs

Note on the codegree version of the Erdős--Ko--Rado theorem

The perturbation threshold of degenerate graphs

Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

Decision problem for Hamilton $2$ -cycles in $4$ -graphs