Indexed metadata

On the multicolour Ramsey numbers R(3,3,k)R(3,3,k)

Bruno Andrades, Marcelo Campos, Robert Morris

Source record

Source: arXiv

Published: Sep 23, 2026

arXiv: 2609.28455

Open original source ↗

Source abstract

In this paper we determine the Ramsey number R(3,3,k)R(3,3,k) up to a constant factor, showing that R(3,3,k)=Θ(k3(logk)2).R(3,3,k) = Θ\bigg( \frac{k^3}{(\log k)^2} \bigg). The proof of the lower bound combines the Hefty-Horn-King-Pfender construction for R(3,k)R(3,k) with the method of Alon and Rödl. Using the same proof, we also determine the rr-colour Ramsey numbers Rr(3,,3,k)R_r(3,\ldots,3,k) up to a constant factor for every fixed r3r \geqslant 3.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.