betaFeedback

WorksMathematics

Asymptotics of the three-color Hadwiger-Ramsey numbers

Abstract

The Hadwiger-Ramsey number Rh(k;ℓ)R_h(k;\ell) is defined as the smallest integer nn such that for any edge coloring of a complete graph on nn vertices in ℓ\ell colors at least one of the color classes induces a graph with a KkK_k minor. We show that Rh(k;3)=(β−1+o(1))kln⁡kR_h(k;3) = \left(β^{-1} + o(1)\right)k \sqrt{\ln k}, where β−1=2/−ln⁡(10−46)=1.58149…β^{-1} = 2/\sqrt{-\ln(10-4\sqrt6)} = 1.58149\ldots. This resolves the first open case of a problem by Axenovich and Steiner, who determined the asymptotic behavior of Rh(k;2)R_h(k;2) and asked about the asymptotics of Rh(k;ℓ)R_h(k;\ell) for ℓ≥3\ell \geq 3.

Paper details

vlnc:W_rghcw8gg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI

View statement
Looking for related papers…