- Senior Researcher, 2020-2022, Theory Lab, Huawei Hong Kong Research Center.
- Assistant Professor, 2018-2020, Department of Mathematics, University of Rhode Island, RI, USA.
- Postdoc research fellow, 2015-2018, Universidade de Sao Paulo. Mentor: Yoshiharu Kohayakawa.
- Postdoc research fellow, 2015-2016, University of Birmingham. Mentor: Deryk Osthus.

Josefran O. Bastos, Fabricio Benevides, Wiebke Bedenknecht, Julia BĂ¶ttcher, Yulin Chang (3), Guantao Chen, Yangyang Cheng (2), Louis DeBiasio, Laihao Ding(2), Asaf Ferber, Peter Frankl, Luyining Gan (4), Wei Gao (3), Huifen Ge, Hiep Han(2), Ping Hu, Hao Huang, Matthew Jenssen, Peter Keevash, Jaehoon Kim(2), Yoshiharu Kohayakawa (12đź‘‘), Shoham Letzter, Allan Lo (2), Dingjia Mao, Richard Montgomery, Patrick Morris(6), Guilherme Oliveira Mota(4), Suil O, Olaf Parczyk(2), Yury Person(4), Joanna Polycn, Barnaby Roberts, Andrzej Rucinski, Marcelo T. Sales(2), NicolĂˇs Sanhueza-Matamala, Songling Shan, Xichao Shu(2), Henrique Stagni(2), Lin Sun, Shumin Sun(2), Lubos Thoma, Andrew Treglown (3), Shoichi Tsuchiya, Bin Wang (2), Guanghui Wang(11đź‘‘), Donglei Yang (6), Chuanyun Zang (2), Yi Zhao (13đź‘‘), Wenling Zhou(2).

- The decision problem for perfect matchings in dense hypergraphs, with Luyining Gan, ICALP 2022, paper 64, 1-16.

We study a conjecture of Keevash-Knox-Mycroft [STOC '13 & Adv. Math. '15] on the decision problem for hypergraph perfect matchings under minimum l-degree condition. Our result reduces the problem to the study of perfect fractional matchings and thus resolves the algorithmic aspect of the decision problem. As a corollary, we resolve the conjecture for lâ‰Ą0.4k. - F-factors in quasirandom hypergraphs, with Laihao Ding, Shumin Sun, Guanghui Wang and Wenling Zhou, JLMS, accepted.

We study the following problem of Lenz and Mubayi: which k-uniform hypergraph F can be perfectly tiled in a sufficiently large linear quasi-random k-uniform hypergraph with a minimum degree condition (assuming the obvious divisibility constraint)? We show that this F-factor problem can be reduced to an F-cover problem, and give a solution to the case k=3. - Non-linear Hamilton cycles in linear quasi-random hypergraphs, with Xichao Shu and Guanghui Wang. SODA '21, 74-88.

We solve a problem of Lenz, Mubayi and Mycroft, showing that given l<k such that k-l does not divide k, linear quasi-randomness together with a minimum (l+1)-degree condition guarantees Hamilton l-cycles in k-uniform hypergraphs, while a similar minimum l-degree does not suffice. - On Perfect Matchings in k-complexes, IMRN, 11(2021), 8741â€“8762.

We give new proofs of several characterization theorems for the existence of perfect matchings in dense simplicial complexes by Keevash and Mycroft [Mem. AMS, 2015]. In particular, our proof avoids the use of the hypergraph regularity lemma and the hypergraph blow-up lemma. Instead, we use the lattice-based absorbing method developed by Han and a recent probabilistic argument of Kohayakawa, Person and Han. - Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs, Trans. AMS, 369-7(2017), 5197-5218.

We show that the decision problem for the containment of perfect matchings in k-uniform hypergraphs with minimum codegree at least n/k can be solved in polynomial time. This solves a problem of Karpinski, Rucinski and Szymanska completely and improves the work of Keevash, Knox and Mycroft.

- Asaf Ferber, Jie Han and Dingjia Mao. Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs.
- Jie Han and Donglei Yang. Spanning trees in sparse expanders.
- Ming Chen, Jie Han, Guanghui Wang and Donglei Yang. H-factors in graphs with small independence number.
- Jie Han, Ping Hu, Guanghui Wang and Donglei Yang. Clique-factors in graphs with sublinear l-independence number.
- Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang and Wenling Zhou. Tiling multipartite hypergraphs in Quasi-random Hypergraphs.
- Yangyang Cheng, Jie Han, Bin Wang, Guanghui Wang and Donglei Yang. Rainbow Hamilton cycle in hypergraph systems.
- Luyining Gan, Jie Han, Lin Sun and Guanghui Wang. Large Y-tilings and Hamilton l-cycles in k-uniform hypergraphs.
- Jie Han, Patrick Morris, Guanghui Wang and Donglei Yang. A Ramsey--Turan theory for tilings in graphs.
- Jie Han, Xichao Shu and Guanghui Wang. Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs.
- Yangyang Cheng, Jie Han, Bin Wang and Guanghui Wang. Rainbow spanning structures in graph and hypergraph systems.
- Yulin Chang, Jie Han and Lubos Thoma. On powers of tight Hamilton cycles in randomly perturbed hypergraphs.
- Fan Chang, Jie Han, Jaehoon Kim, Guanghui Wang and Donglei Yang. Embedding clique-factors in graphs with low l-independence number, JCTB, accepted.
- Luyining Gan, Wei Gao and Jie Han. On zero-nonzero and sign patterns allowing S_n* or S_n, Linear and Multilinear Algebra, to appear.
- Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang and Wenling Zhou. F-factors in quasirandom hypergraphs, JLMS, 106(2022), No. 3, 1810-1843.
- Yulin Chang, Huifen Ge, Jie Han and Guanghui Wang. Matchings of given sizes in hypergraphs, SIDMA, 36(2022), No. 3, 2323-2338.
- Jie Han. Cover 3-uniform hypergraphs by vertex-disjoint tight paths, JGT, 101(2022), No. 4, 782-802.
- Luyining Gan and Jie Han. The decision problem for perfect matchings in dense hypergraphs, ICALP 2022, paper 64, 1-16.
- Jie Han and Yi Zhao. TurĂˇn number of disjoint triangles in 4-partite graphs, Elec. JC, 29(2), 2022, #P2.35.
- Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai and Gong Zhang. Structural Entropy of the Stochastic Block Models. Entropy 2022, 24(1), 81.
- Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris and Guilherme O. Mota. Factors in randomly perturbed hypergraphs. RS&A, 60(2022), 153-165.
- Hiep Han, Jie Han and Yi Zhao. Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniformÂ hypergraphs. JCTB, 153(2022), 105-148.
- Luyining Gan and Jie Han. Hamiltonicity in Cherry-quasirandom 3-graphs. European JC, 102(2022)103457.
- Jie Han, Yoshiharu Kohayakawa, and Yury Person. Near-perfect clique-factors in sparse pseudorandom graphs CPC, 30(2021), 570-590. An extended abstract of this paper appears in the Proceedings of Discrete Mathematics Days 2018 (Sevilla).
- Longlong Li, Hu Chen, Ping Li, Jie Han, Guanghui Wang and Gong Zhang. The K-Core Decomposition Algorithm Under the Framework of GraphBLAS, HPEC 2021.
- Jie Han, Joanna Polycn and Andrzej RuciĹ„ski. TurĂˇn and Ramsey numbers for 3-uniform minimal paths of length 4. JGT, 98(2021), No. 3, 460-498.
- Jie Han, Yoshiharu Kohayakawa, Shoham Letzter, Guilherme O. Mota and Olaf Parczyk. The size-Ramsey number of 3-uniform tight paths. Advances in Combinatorics, 2021:5, 12 pp.
- Jie Han. On perfect matchings in k-complexes IMRN, 11(2021), 8741â€“8762.
- Jie Han, Allan Lo and NicolĂˇs Sanhueza-Matamala. Covering and tiling hypergraphs with tight cycles CPC, 30(2021), 288-329. An extended abstract of this paper appeared in Eurocomb '17.
- Jie Han, Patrick Morris and Andrew Treglown. Tilings in randomly perturbed graphs: bridging the gap between Hajnal--SzemerĂ©di and Johansson--Kahn--Vu. RS&A, 58 (2021) 480-516.
- Jie Han, Yoshiharu Kohayakawa, Patrick Morris, and Yury Person. Finding any given 2-factor in sparse pseudorandom graphs efficiently. JGT, 96(2021), no. 1, Special issue: Ron Graham, 87-108.
- Jie Han, Xichao Shu and Guanghui Wang.
Non-linear Hamilton cycles in linear quasi-random hypergraphs. SODA 2021, 74-88.
#### 2020

- Jie Han, Chuanyun Zang and Yi Zhao. Matchings in k-partite k-uniform hypergraphs JGT, 95(2020), no. 1, 34-58.
- Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, and Barnaby Roberts. The multicolour size-Ramsey number of powers of paths. JCTB, 145(2020), 359-375.
- Josefran de Oliveira Bastos, Fabricio S. Benevides, and Jie Han. The number of Gallai k-colorings of complete graphs. JCTB, 144(2020), 1-13.
- Jie Han and Yi Zhao. Hamiltonicity in randomly perturbed hypergraphs JCTB, 144(2020), 14-31.
- Jie Han and Peter Keevash. Finding perfect matchings in dense hypergraphs. SODA 2020, pp. 2366-2377.
- Hiep Han, Jie Han, and Patrick Morris. Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs SODA 2020, pp. 702-717. The full version of this paper appears in RS&A, 61 (2022), no. 1, 101-125.
- Jie Han and Andrew Treglown. The complexity of perfect matchings and packings in dense hypergraphs JCTB, 141(2020), 72-104.
- Jie Han, Yoshiharu Kohayakawa, Patrick Morris, and Yury Person. Clique-factors in sparse pseudorandom graphs European JC, Volume 82 (December 2019) 102999.
- Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, and Guilherme O. Mota. Powers of tight Hamilton cycles in randomly perturbed hypergraphs RS&A, 55-4(2019) 795-807.
- Julia BĂ¶ttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk and Yury Person. Universality for bounded degree spanning trees in randomly perturbed graphs RS&A, 55-4(2019) 854-864.
- Wei Gao, Jie Han and Yi Zhao. Codegree conditions for tiling complete k-partite k-graphs and loose cycles CPC, 28-6 (2019) 840-870.
- Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales and Henrique Stagni. Extremal and probabilistic results for order types. SODA 2019, pp 426-435.
- Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, and Henrique Stagni. Property testing for point sets on the plane. LATIN 2018. LNCS, vol 10807, 584-596.
- Jie Han. On vertex-disjoint paths in regular graphs Elec. JC, 25-2(2018), P2.12.
- Jie Han. On perfect matchings and tilings in uniform hypergraphs SIDMA, 32-2 (2018), 919â€“932.
- Peter Frankl, Jie Han, Hao Huang and Yi Zhao. A degree version of the Hilton--Milner Theorem, JCTA, 155(2018) 493-502.
- Jie Han and Yoshiharu Kohayakawa. On hypergraphs without loose cycles, Discrete Math, 341-4(2018) 946-949.
- Jie Han and Jaehoon Kim. Two-regular subgraphs of odd-uniform hypergraphs, JCTB, 128(2018) 175-191.
- Guantao Chen, Jie Han, Suil O, Songling Shan, and Shoichi Tsuchiya. Forbidden pairs and the existence of a spanning Halin subgraph. Graphs and Combin., 33-5(2017) 1321-1345.
- Jie Han, Allan Lo, Andrew Treglown and Yi Zhao. Exact minimum codegree threshold for K^-_4-factors CPC, 26-6(2017) 856-885.
- Wei Gao and Jie Han. Minimum codegree threshold for C_6^3-factors in 3-uniform hypergraphs. CPC, 26-4 (2017) 536-559.
- Jie Han. The complexity of perfect packings in dense graphs. TAMC 2017. LNCS, vol 10185.
- Jie Han. Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs Transactions of the AMS, 369-7(2017), 5197-5218.
- Jie Han, Chuanyun Zang and Yi Zhao. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs JCTA, 149(2017) 115-147.
- Jie Han and Yoshiharu Kohayakawa. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family Proceedings of the AMS, 145-1(2017) 73â€“87.
- Jie Han. Near perfect matchings in k-uniform hypergraphs II SIDMA 30-3 (2016) 1453-1469.
- Jie Han. Perfect matchings in hypergraphs and the Erdos Matching Conjecture SIDMA 30-3 (2016) 1351-1357.
- Jie Han and Yi Zhao. Forbidding Hamilton cycles in uniform hypergraphs JCTA, 143 (2016) 107â€“115.
- Jie Han and Yi Zhao. Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs JCTA, 132 (2015) 194-223.
- Jie Han. Near perfect matchings k-uniform hypergraphs CPC 24 (2015), no. 5, 723-732.
- Jie Han and Yi Zhao. Minimum vertex degree threshold for C_4^3-tiling JGT, 79 (2015), no. 4, 300-317.
- Jie Han and Yi Zhao. Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs JCTB, 114 (2015) 70-96.
- Jie Han and Yi Zhao. On multipartite Hajnal-Szemeredi theorems Discrete Math, 313-10(2013) 1119-1129.

PhD thesis. Perfect Matchings, Tilings, Hamilton Cycles in Hypergraphs. Georgia State University, May 2015.