64 citations · 171 across the 34 of their papers we have counts for
4 papers · 1 filter
Simonovits's theorem in random graphs
Ilay Hoshen, Wojciech Samotij
Let be a graph with . Simonovits's theorem states that, if is edge-critical, the unique largest -free subgraph of is its largest -partite subgraph,…
On the Kohayakawa-Kreuter conjecture
Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson
Let us say that a graph is Ramsey for a tuple of graphs if every -coloring of the edges of contains a monochromatic copy of in color , for som…
The list-Ramsey threshold for families of graphs
Eden Kuperwasser, Wojciech Samotij
Given a family of graphs and an integer , we say that a graph is -Ramsey for if any -colouring of its edges admits a monochromatic copy of a gr…
Two-round Ramsey games on random graphs
Yahav Alon, Patrick Morris, Wojciech Samotij
Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a singl…