activity
20132018
most citedMinimum Degrees of Minimal Ramsey Graphs for Almost-Cliques

6 citations · 7 across the 7 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

math.CO2015

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…