6 citations · 7 across the 7 of their papers we have counts for
7 papers
Online Ramsey Numbers and the Subgraph Query Problem
David Conlon, Jacob Fox, Andrey Grinshpun +1
The -online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each t…
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 of Minimal Ramsey Graphs for Almost-Cliques
Andrey Grinshpun, Raj Raina, Rik Sengupta
For graphs and , we say is Ramsey for if every -coloring of the edges of contains a monochromatic copy of . The graph is Ramsey -minimal if is R…
Monochromatic bounded degree subgraph partitions
Andrey Grinshpun, Gabor N. Sarkozy
Let be a sequence of graphs such that is a graph on vertices with maximum degree at most . We show that there exists an absolute constan…
What is Ramsey-equivalent to a clique?
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if…
The Erdős-Hajnal conjecture for rainbow triangles
J. Fox, A. Grinshpun, J. Pach
We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order Omega(n^{1/3}log^2 n) which uses at most two colo…
Alternating Traps in Muller and Parity Games
A. Grinshpun, P. Phalitnonkiat, S. Rubin +1
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is…