27 citations · 40 across the 5 of their papers we have counts for
5 papers
Turán and Ramsey numbers for -uniform minimal paths of length
Jie Han, Joanna Polcyn, Andrzej Ruciński
We determine Turán numbers for the family of 3-uniform minimal paths of length four \emph{for all }. We also establish the second and third order Turán numbers and use them to c…
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 number of Gallai k-colorings of complete graphs
Josefran de Oliveira Bastos, Fabricio S. Benevides, Jie Han
An edge coloring of the -vertex complete graph, , is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three d…
The complexity of perfect matchings and packings in dense hypergraphs
Jie Han, Andrew Treglown
Given two -graphs and , a perfect -packing in is a collection of vertex-disjoint copies of in which together cover all the vertices in . In the case whe…
Near Perfect Matchings in -uniform Hypergraphs
Jie Han
Let be a -uniform hypergraph on vertices where is a sufficiently large integer not divisible by . We prove that if the minimum -degree of is at least $…