Ramsey-nice families of graphs

Ron Aharoni, Noga Alon, Michal Amir +5

For a finite family $\mathcal{F}$ of fixed graphs let $R_k(\mathcal{F})$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a…