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

5 papers · 1 filter

math.CO2017

On vertex-disjoint paths in regular graphs

Jie Han

Let $c \in (0, 1]$ be a real number and let $n$ be a sufficiently large integer. We prove that every $n$ -vertex $c n$ -regular graph $G$ contains a collection of $\lfloor 1/c \rfloor…

math.CO2017

On Perfect Matchings and tilings in uniform Hypergraphs

Jie Han

In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k \geq 3$ , if $H$ is a $k$ -graph on $n \in k N$ vertices with independence…

math.CO2017★ 1 cited

On hypergraphs without loose cycles

Jie Han, Yoshiharu Kohayakawa

Recently, Mubayi and Wang showed that for $r \geq 4$ and $ℓ \geq 3$ , the number of $n$ -vertex $r$ -graphs that do not contain any loose cycle of length $ℓ$ is at most $2^{O( n^{r…

math.CO2017

A degree version of the Hilton--Milner theorem

Peter Frankl, Jie Han, Hao Huang +1

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erdős--Ko--Rado theore…

math.CO2017★ 8 cited

Covering and tiling hypergraphs with tight cycles

Jie Han, Allan Lo, Nicolás Sanhueza-Matamala

Given $3 \leq k \leq s$ , we say that a $k$ -uniform hypergraph $C_{s}^{k}$ is a tight cycle on $s$ vertices if there is a cyclic ordering of the vertices of $C_{s}^{k}$ such that every $k$ …