Jie Han

According to our database1, Jie Han authored at least 28 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Matchings in k-partite k-uniform hypergraphs.
J. Graph Theory, 2020

Hamiltonicity in randomly perturbed hypergraphs.
J. Comb. Theory, Ser. B, 2020

The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory, Ser. B, 2020

The complexity of perfect matchings and packings in dense hypergraphs.
J. Comb. Theory, Ser. B, 2020

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.
Eur. J. Comb., 2019

Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles.
Comb. Probab. Comput., 2019

Extremal and probabilistic results for order types.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
A degree version of the Hilton-Milner theorem.
J. Comb. Theory, Ser. A, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2018

On hypergraphs without loose cycles.
Discret. Math., 2018

Property Testing for Point Sets on the Plane.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs.
J. Comb. Theory, Ser. A, 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
Graphs Comb., 2017

Covering and tiling hypergraphs with tight cycles.
Electron. Notes Discret. Math., 2017

Exact Minimum Codegree Threshold for K - 4-Factors.
Comb. Probab. Comput., 2017

Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2017

The Complexity of Perfect Packings in Dense Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
Near Perfect Matchings in k-Uniform Hypergraphs II.
SIAM J. Discret. Math., 2016

Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture.
SIAM J. Discret. Math., 2016

Forbidding Hamilton cycles in uniform hypergraphs.
J. Comb. Theory, Ser. A, 2016

2015
Minimum vertex degree threshold for C43-tiling.
J. Graph Theory, 2015

Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2015

Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs.
J. Comb. Theory, Ser. A, 2015

Near Perfect Matchings in <i>k</i>-Uniform Hypergraphs.
Comb. Probab. Comput., 2015

2013
On multipartite Hajnal-Szemerédi theorems.
Discret. Math., 2013


  Loading...