A note on Ramsey numbers for minors

Abstract

Let $R_h(k; \ell)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $\ell$ colors results in a monochromatic graph with Hadwiger number $k$, i.e., a graph that could be transformed into a clique on $k$ vertices via a sequence of edge contractions and vertex deletions. We show that $$k \sqrt{\log k} (1+o(1)) \leq R_h(k; 2) \leq 1.031\cdot k \sqrt{\log k} (1+o(1))$$ and for a constant $β=0.265656...$, $$ R_h(k; \ell) = 2β\ell k \sqrt{\log k} (1+o(1)).$$

Theorems & Definitions (6)

• Theorem 1.1: Thomason T
• Theorem 1.2: Bollobás, Catlin, and Erdős BCE
• Theorem 1.3: Theorem 4.1, Thomason T
• Theorem 1.4
• Theorem 1.5
• Theorem 3.1: Messuti, Rödl, Schacht MRS