36 citations · 224 across the 54 of their papers we have counts for
5 papers · 1 filter
On Perfect Matchings in -complexes
Jie Han
Keevash and Mycroft [\emph{Mem.~Amer.~Math.~Soc., 2015}] developed a geometric theory for hypergraph matchings and characterized the dense simplicial complexes that contain a perfe…
The size-Ramsey number of 3-uniform tight paths
Jie Han, Yoshiharu Kohayakawa, Shoham Letzter +2
Given a hypergraph , the size-Ramsey number is the smallest integer such that there exists a graph with edges with the property that in any colouring…
Turán number of disjoint triangles in 4-partite graphs
Jie Han, Yi Zhao
Let and be integers such that is sufficiently larger than . We determine the maximum number of edges of a 4-partite graph with parts of…
Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
Jie Han, Patrick Morris, Andrew Treglown
A perfect -tiling in a graph is a collection of vertex-disjoint copies of that together cover all the vertices in . In this paper we consider perfect -tiling…
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $φ\colon V(H)\to V(…