Andrey Grinshpun

According to our database, Andrey Grinshpun authored at least 6 papers between 2014 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques.

Andrey Grinshpun, Raj Raina, Rik Sengupta

J. Graph Theory, 2017

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, Ser. B, 2016

Monochromatic bounded degree subgraph partitions.

Andrey Grinshpun, Gábor N. Sárközy

Discret. Math., 2016

2015

The Erdős-Hajnal conjecture for rainbow triangles.

Jacob Fox, Andrey Grinshpun, János Pach

J. Comb. Theory, Ser. B, 2015

2014

Alternating traps in Muller and parity games.

Andrey Grinshpun, Pakawat Phalitnonkiat, Sasha Rubin, Andrei Tarfulea

Theor. Comput. Sci., 2014

What is Ramsey-equivalent to a clique?

Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó

J. Comb. Theory, Ser. B, 2014