An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem

arXiv2105.08850MaRDI QIDQ6367992FDOQ6367992

William F. Sawin

Publication date: 18 May 2021

Abstract: The multicolor Ramsey number problem asks, for each pair of natural numbers $ell$ and $t$, for the largest $ell$-coloring of a complete graph with no monochromatic clique of size $t$. Recent works of Conlon-Ferber and Wigderson have improved the longstanding lower bound for this problem. We make a further improvement by replacing an explicit graph appearing in their constructions by a random graph. Graphs useful for this construction are exactly those relevant for a problem of ErdH{o}s on graphs with no large cliques and few large independent sets. We also make some basic observations about this problem.

This page was built for publication: An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367992)