5 citations · 10 across the 11 of their papers we have counts for
16 papers
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…
On the optimality of the uniform random strategy
Christopher Kusch, Juanjo Rué, Christoph Spiegel +1
The concept of biased Maker-Breaker games, introduced by Chvátal and Erd{\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random…
A family of extremal hypergraphs for Ryser's conjecture
Ahmad Abu-Khazneh, János Barát, Alexey Pokrovskiy +1
Ryser's Conjecture states that for any -partite -uniform hypergraph, the vertex cover number is at most times the matching number. This conjecture is only known to be…
Sharp thresholds for half-random games II
Jonas Groschwitz, Tibor Szabó
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case…
Sharp thresholds for half-random games I
Jonas Groschwitz, Tibor Szabó
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scen…
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…