12 citations · 40 across the 27 of their papers we have counts for
5 papers · 1 filter
A sharp threshold for van der Waerden's theorem in random subsets
E. Friedgut, H. Hàn, Y. Person +1
We establish sharpness for the threshold of van der Waerden's theorem in random subsets of . More precisely, for and $Z\subseteq \mathbb{Z}/n\math…
On universal hypergraphs
Samuel Hetterich, Olaf Parczyk, Yury Person
A hypergraph is called universal for a family of hypergraphs, if it contains every hypergraph as a copy. For the family of -uniform hypergr…
Spanning structures and universality in sparse hypergraphs
Olaf Parczyk, Yury Person
In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs,…
On the minimum degree of minimal Ramsey graphs for multiple colours
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minima…
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
Dennis Clemens, Yury Person
A uniform hypergraph is called -Ramsey for a hypergraph , if no matter how one colors the edges of with colors, there is always a monochromatic copy of . We sa…