36 citations · 224 across the 54 of their papers we have counts for
6 papers · 1 filter
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 multicolour size-Ramsey number of powers of paths
Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa +2
Given a positive integer , a graph is -Ramsey for a graph , denoted , if every -colouring of the edges of contains a monochromatic copy of $…
Clique-factors in sparse pseudorandom graphs
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
We prove that for any there exist constants and such that any -regular -vertex graph with and second largest eigenvalue in absolute…
Near-perfect clique-factors in sparse pseudorandom graphs
Jie Han, Yoshiharu Kohayakawa, Yury Person
We prove that, for any , there exists a constant such that any -regular -vertex graph with the second largest eigenvalue in absolute value~ satisfying $…
Universality for bounded degree spanning trees in randomly perturbed graphs
Julia Böttcher, Jie Han, Yoshiharu Kohayakawa +3
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spa…
Hamiltonicity in randomly perturbed hypergraphs
Jie Han, Yi Zhao
For integers and , we prove that for any , there exist and such that for sufficiently large , the union of a $k…