1 citations · 2 across the 4 of their papers we have counts for
4 papers
Spanning -cycles in random graphs
Alberto Espuny Díaz, Yury Person
We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanni…
An algorithmic framework for obtaining lower bounds for random Ramsey problems
Rajko Nenadov, Yury Person, Nemanja Škorić +1
In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algori…
Keeping Avoider's graph almost acyclic
Dennis Clemens, Julia Ehrenmüller, Yury Person +1
We consider biased Avoider-Enforcer games in the monotone and strict versions. In particular, we show that Avoider can keep his graph being a forest for every but maybe the…
A regularity lemma and twins in words
Maria Axenovich, Yury Person, Svetlana Puzynina
For a word , let be the largest integer such that there are two disjoints identical (scattered) subwords of length . Let $f(n, Σ) = \min \{f(S): S \text{is of leng…