Jie Han

collaborators

3 papers

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

math.CO2026

The perturbation threshold of degenerate graphs

Jie Han, Seonghyuk Im, Bin Wang +1

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

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

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

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