36 citations · 224 across the 54 of their papers we have counts for
5 papers · 2 filters
On vertex-disjoint paths in regular graphs
Jie Han
Let be a real number and let be a sufficiently large integer. We prove that every -vertex -regular graph contains a collection of $\lfloor 1/c \rfloor…
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 , if is a -graph on vertices with independence…
On hypergraphs without loose cycles
Jie Han, Yoshiharu Kohayakawa
Recently, Mubayi and Wang showed that for and , the number of -vertex -graphs that do not contain any loose cycle of length is at most $2^{O( n^{r…
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…
Covering and tiling hypergraphs with tight cycles
Jie Han, Allan Lo, Nicolás Sanhueza-Matamala
Given , we say that a -uniform hypergraph is a tight cycle on vertices if there is a cyclic ordering of the vertices of such that every …