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

4 papers · 1 filter

math.CO2023

A parameterized algorithm for $K_{r}$ -factors in graphs of high minimum degree

Luyining Gan, Jie Han, Jie Hu

A $K_{r}$ -factor of a graph $G$ is a collection of vertex-disjoint $r$ -cliques covering $V (G)$ . We prove the following algorithmic version of the classical Hajnal--Szemerédi Theorem…

math.CO2023

On powers of Hamilton cycles in Ramsey-Turán Theory

Ming Chen, Jie Han, Yantao Tang +1

We prove that for $r \in N$ with $r \geq 2$ and $μ > 0$ , there exist $α > 0$ and $n_{0}$ such that for every $n \geq n_{0}$ , every $n$ -vertex graph $G$ with $δ(G)\geq \left(1-\fr…

math.CO2023

Large $Y_{3, 2}$ -tilings in 3-uniform hypergraphs

Jie Han, Lin Sun, Guanghui Wang

Let $Y_{3, 2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $H$ on $n$ vertices with at least $ \max \left \{ \binom{4αn}{3}, \binom{n…

math.CO2023

Spanning trees in graphs without large bipartite holes

Jie Han, Jie Hu, Lidan Ping +3

We show that for any $ε > 0$ and $Δ \in N$ , there exists $α > 0$ such that for sufficiently large $n$ , every $n$ -vertex graph $G$ satisfying that $δ(G)\geq\varepsilon…

A parameterized algorithm for Kr​-factors in graphs of high minimum degree

On powers of Hamilton cycles in Ramsey-Turán Theory

Large Y3,2​-tilings in 3-uniform hypergraphs

Spanning trees in graphs without large bipartite holes

A parameterized algorithm for $K_{r}$ -factors in graphs of high minimum degree

Large $Y_{3, 2}$ -tilings in 3-uniform hypergraphs