What is Ramsey-equivalent to a clique? - Jacob Fox; Andrey Grinshpun; Anita Liebenau; Yury Person; Tibor Szabó (J. Comb. Theory B, 2014)

Alternating traps in Muller and parity games. - Andrey Grinshpun; Pakawat Phalitnonkiat; Sasha Rubin; Andrei Tarfulea (Theor. Comput. Sci., 2014)

The Erdős-Hajnal conjecture for rainbow triangles. - Jacob Fox; Andrey Grinshpun; János Pach (J. Comb. Theory B, 2015)

Monochromatic bounded degree subgraph partitions. - Andrey Grinshpun; Gábor N. Sárközy (Discret. Math., 2016)

On the minimum degree of minimal Ramsey graphs for multiple colours. - Jacob Fox; Andrey Grinshpun; Anita Liebenau; Yury Person; Tibor Szabó (J. Comb. Theory B, 2016)

Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques. - Andrey Grinshpun; Raj Raina; Rik Sengupta (J. Graph Theory, 2017)