2 citations · 4 across the 4 of their papers we have counts for
5 papers · 1 filter
On the anti-Ramsey threshold
Eden Kuperwasser
We say that a graph is anti-Ramsey for a graph if any proper edge-colouring of yields a rainbow copy of , i.e. a copy of whose edges all receive different colour…
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…
Sharp thresholds for Ramsey properties
Ehud Friedgut, Eden Kuperwasser, Wojciech Samotij +1
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability o…
List Ramsey numbers
N. Alon, M. Bucić, T. Kalvari +2
We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each oth…