Lower bounds for multicolor Ramsey numbers

DOI10.1016/j.aim.2020.107528zbMath1456.05114arXiv2009.10458OpenAlexW3112491806MaRDI QIDQ2219333

David Conlon, Asaf Ferber

Publication date: 20 January 2021

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.10458

zbMATH Keywords

Ramsey numbersmonochromatic cliques

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (6)

A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ Ramsey properties of algebraic graphs and hypergraphs ⋮ A lower bound for set‐coloring Ramsey numbers ⋮ Algorithmic obstructions in the random number partitioning problem ⋮ An improved lower bound on multicolor Ramsey numbers ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős

Cites Work

• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Ramsey's theorem - a new lower bound
• Constructive bounds for a Ramsey-type problem
• Graph complexity
• Some remarks on the theory of graphs
• Diagonal Ramsey via effective quasirandomness

This page was built for publication: Lower bounds for multicolor Ramsey numbers