activity
20102026
most citedThe maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family

27 citations · 137 across the 40 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

math.CO2018★ 2 cited

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 $…

math.CO2018

Counting restricted orientations of random graphs

Maurício Collares, Yoshiharu Kohayakawa, Robert Morris +1

We count orientations of avoiding certain classes of oriented graphs. In particular, we study , the number of orientations of the binomial random graph …

math.CO2018

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…

math.CO2018★ 6 cited

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 $…

math.CO2018

Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa +1

For and such that , we prove that, for any , there exists such that the union of an -vertex -graph with minimum codegree $\left(1-\bino…

math.CO2018

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…