3 papers
math.CO2025
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…
math.CO2019
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…
math.OC2017
Approachability with Constraints
Gaëtan Fournier, Eden Kuperwasser, Orin Munk +2
We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Pla…