1 paper
Maria Axenovich, Raphael Steiner
Let Rh(k;ℓ) be the smallest integer n such that any edge coloring of a complete graph on n vertices in ℓ colors results in a monochromatic Kk-minor, in other wor…