A. Grinshpun

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 2014Show all

2 papers · 1 filter

math.CO2014★ 6 cited

Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques

Andrey Grinshpun, Raj Raina, Rik Sengupta

For graphs $F$ and $H$ , we say $F$ is Ramsey for $H$ if every $2$ -coloring of the edges of $F$ contains a monochromatic copy of $H$ . The graph $F$ is Ramsey $H$ -minimal if $F$ is R…

math.CO2014★ 1 cited

Monochromatic bounded degree subgraph partitions

Andrey Grinshpun, Gabor N. Sarkozy

Let $F = {F_{1}, F_{2}, \dots}$ be a sequence of graphs such that $F_{n}$ is a graph on $n$ vertices with maximum degree at most $Δ$ . We show that there exists an absolute constan…