Jie Han

According to our database, Jie Han authored at least 42 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs.

Luyining Gan, Jie Han, Lin Sun, Guanghui Wang

J. Graph Theory, November, 2023

Embedding clique-factors in graphs with low <i>ℓ</i>-independence number.

Fan Chang, Jie Han, Jaehoon Kim, Guanghui Wang, Donglei Yang

J. Comb. Theory, Ser. B, July, 2023

2022

Matching of Given Sizes in Hypergraphs.

Yulin Chang, Huifen Ge, Jie Han, Guanghui Wang

SIAM J. Discret. Math., September, 2022

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.

Hiêp Hàn, Jie Han, Patrick Morris

Random Struct. Algorithms, 2022

Factors in randomly perturbed hypergraphs.

Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota

Random Struct. Algorithms, 2022

Covering 3-uniform hypergraphs by vertex-disjoint tight paths.

Jie Han

J. Graph Theory, 2022

Minimum degree thresholds for Hamilton (<i>k</i>/2)-cycles in <i>k</i>-uniform hypergraphs.

Hiêp Hàn, Jie Han, Yi Zhao

J. Comb. Theory, Ser. B, 2022

Structural Entropy of the Stochastic Block Models.

Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai, Gong Zhang

Entropy, 2022

Hamiltonicity in Cherry-quasirandom 3-graphs.

Luyining Gan, Jie Han

Eur. J. Comb., 2022

Semantic Compression with Side Information: A Rate-Distortion Perspective.

Tao Guo, Yizhu Wang, Jie Han, Huihui Wu, Bo Bai, Wei Han

CoRR, 2022

Protecting Semantic Information Using An Efficient Secret Key.

Tao Guo, Jie Han, Huihui Wu, Yizhu Wang, Bo Bai, Wei Han

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Decision Problem for Perfect Matchings in Dense Hypergraphs.

Luyining Gan, Jie Han

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu.

Jie Han, Patrick Morris, Andrew Treglown

Random Struct. Algorithms, 2021

Finding any given 2-factor in sparse pseudorandom graphs efficiently.

Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person

J. Graph Theory, 2021

2020

Matchings in k-partite k-uniform hypergraphs.

Jie Han, Chuanyun Zang, Yi Zhao

J. Graph Theory, 2020

Hamiltonicity in randomly perturbed hypergraphs.

Jie Han, Yi Zhao

J. Comb. Theory, Ser. B, 2020

The multicolour size-Ramsey number of powers of paths.

Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts

J. Comb. Theory, Ser. B, 2020

The number of Gallai <i>k</i>-colorings of complete graphs.

Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Jie Han

J. Comb. Theory, Ser. B, 2020

The complexity of perfect matchings and packings in dense hypergraphs.

Jie Han, Andrew Treglown

J. Comb. Theory, Ser. B, 2020

2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person

Random Struct. Algorithms, 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.

Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota

Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.

Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person

Eur. J. Comb., 2019

Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles.

Wei Gao, Jie Han, Yi Zhao

Comb. Probab. Comput., 2019

Extremal and probabilistic results for order types.

Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

A degree version of the Hilton-Milner theorem.

Peter Frankl, Jie Han, Hao Huang, Yi Zhao

J. Comb. Theory, Ser. A, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.

Jie Han, Yoshiharu Kohayakawa, Yury Person

Electron. Notes Discret. Math., 2018

On hypergraphs without loose cycles.

Jie Han, Yoshiharu Kohayakawa

Discret. Math., 2018

Property Testing for Point Sets on the Plane.

Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs.

Jie Han, Chuanyun Zang, Yi Zhao

J. Comb. Theory, Ser. A, 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.

Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya

Graphs Comb., 2017

Covering and tiling hypergraphs with tight cycles.

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

Electron. Notes Discret. Math., 2017

Exact Minimum Codegree Threshold for K - 4-Factors.

Jie Han, Allan Lo, Andrew Treglown, Yi Zhao

Comb. Probab. Comput., 2017

Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs.

Wei Gao, Jie Han

Comb. Probab. Comput., 2017

The Complexity of Perfect Packings in Dense Graphs.

Jie Han

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

Near Perfect Matchings in k-Uniform Hypergraphs II.

Jie Han

SIAM J. Discret. Math., 2016

Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture.

Jie Han

SIAM J. Discret. Math., 2016

Forbidding Hamilton cycles in uniform hypergraphs.

Jie Han, Yi Zhao

J. Comb. Theory, Ser. A, 2016

2015

Minimum vertex degree threshold for C43-tiling.

Jie Han, Yi Zhao

J. Graph Theory, 2015

Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs.

Jie Han, Yi Zhao

J. Comb. Theory, Ser. B, 2015

Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs.

Jie Han, Yi Zhao

J. Comb. Theory, Ser. A, 2015

Near Perfect Matchings in <i>k</i>-Uniform Hypergraphs.

Jie Han

Comb. Probab. Comput., 2015

2013

On multipartite Hajnal-Szemerédi theorems.

Jie Han, Yi Zhao

Discret. Math., 2013