Universality for bounded degree spanning trees in randomly perturbed graphs J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person
Random Structures & Algorithms 55 (4), 854-864, 2019
67 2019 Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs J Han, Y Zhao
Journal of Combinatorial Theory, Series B 114, 70-96, 2015
53 2015 Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs J Han, Y Zhao
Journal of Combinatorial Theory, Series A 132, 194-223, 2015
50 2015 Powers of tight Hamilton cycles in randomly perturbed hypergraphs W Bedenknecht, J Han, Y Kohayakawa, GO Mota
Random Structures & Algorithms 55 (4), 795-807, 2019
44 2019 Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs J Han
Transactions of the American Mathematical Society 369 (7), 5197-5218, 2017
43 2017 Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu J Han, P Morris, A Treglown
Random Structures & Algorithms 58 (3), 480-516, 2021
42 2021 The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family J Han, Y Kohayakawa
Proceedings of the American Mathematical Society 145 (1), 73-87, 2017
42 2017 Hamiltonicity in randomly perturbed hypergraphs J Han, Y Zhao
Journal of Combinatorial Theory, Series B 144, 14-31, 2020
40 2020 Forbidding Hamilton cycles in uniform hypergraphs J Han, Y Zhao
Journal of Combinatorial Theory, Series A 143, 107-115, 2016
27 2016 Near perfect matchings in k-uniform hypergraphs J Han
Combinatorics, Probability and Computing 24 (5), 723-732, 2015
27 2015 Rainbow spanning structures in graph and hypergraph systems Y Cheng, J Han, B Wang, G Wang
Forum of Mathematics, Sigma 11, e95, 2023
26 2023 The complexity of perfect matchings and packings in dense hypergraphs J Han, A Treglown
Journal of Combinatorial Theory, Series B 141, 72-104, 2020
26 2020 Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs J Han, C Zang, Y Zhao
Journal of Combinatorial Theory, Series A 149, 115-147, 2017
25 2017 Perfect matchings in hypergraphs and the Erdos matching conjecture J Han
SIAM Journal on Discrete Mathematics 30 (3), 1351-1357, 2016
25 2016 The multicolour size-Ramsey number of powers of paths J Han, M Jenssen, Y Kohayakawa, GO Mota, B Roberts
Journal of Combinatorial Theory, Series B 145, 359-375, 2020
24 2020 Minimum Vertex Degree Threshold for‐tiling J Han, Y Zhao
Journal of Graph Theory 79 (4), 300-317, 2015
22 2015 The number of Gallai k-colorings of complete graphs J de Oliveira Bastos, FS Benevides, J Han
Journal of Combinatorial Theory, Series B 144, 1-13, 2020
20 2020 The size-Ramsey number of 3-uniform tight paths J Han, Y Kohayakawa, S Letzter, GO Mota, O Parczyk
arXiv preprint arXiv:1907.08086, 2019
14 2019 Near Perfect Matchings in J Han
SIAM Journal on Discrete Mathematics 30 (3), 1453-1469, 2016
14 2016 Near-perfect clique-factors in sparse pseudorandom graphs J Han, Y Kohayakawa, Y Person
Electronic Notes in Discrete Mathematics 68, 221-226, 2018
13 2018 
Yoshiharu KohayakawaInstituto de Matemática e Estatística, Universidade de São Paulo, BrazilEmail verificata su ime.usp.br
