Y. Person

activity

20112026

most citedQuasirandomness in hypergraphs

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

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018

Monochromatic Schur triples in randomly perturbed dense sets of integers

Elad Aigner-Horev, Yury Person

Given a dense subset $A$ of the first $n$ positive integers, we provide a short proof showing that for $p = ω (n^{- 2/3})$ the so-called {\sl randomly perturbed} set $A \cup [n]_{p}$ a.a…

math.CO2018

Clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

We prove that for any $t \geq 3$ there exist constants $c > 0$ and $n_{0}$ such that any $d$ -regular $n$ -vertex graph $G$ with $t ∣ n \geq n_{0}$ 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 $t \geq 3$ , there exists a constant $c = c (t) > 0$ such that any $d$ -regular $n$ -vertex graph with the second largest eigenvalue in absolute value~ $λ$ satisfying $…

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…