WorksMathematics
Asymptotics of the three-color Hadwiger-Ramsey numbers
Abstract
The Hadwiger-Ramsey number is defined as the smallest integer such that for any edge coloring of a complete graph on vertices in colors at least one of the color classes induces a graph with a minor. We show that , where . This resolves the first open case of a problem by Axenovich and Steiner, who determined the asymptotic behavior of and asked about the asymptotics of for .