12 citations · 40 across the 27 of their papers we have counts for
4 papers · 1 filter
Largest components in random hypergraphs
Oliver Cooley, Mihyun Kang, Yury Person
In this paper we consider -tuple-connected components in random -uniform hypergraphs (the -tuple-connectedness relation can be defined by letting two -sets be connected…
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…
Powers of Hamilton cycles in pseudorandom graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph is …