An improved lower bound on multicolor Ramsey numbers

DOI10.1090/proc/15447zbMath1462.05251arXiv2009.12020OpenAlexW3111103564MaRDI QIDQ4985371

Yuval Wigderson

Publication date: 23 April 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

multicolor diagonal Ramsey numbersLefmann's lower bound

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (5)

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 ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors

Cites Work

• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Ramsey's theorem - a new lower bound
• Lower bounds for multicolor Ramsey numbers
• Multicolor Ramsey numbers via pseudorandom graphs
• Sharp bounds for some multicolour Ramsey numbers
• On Subsets with Intersections of Even Cardinality
• Lovász, Vectors, Graphs and Codes
• Some remarks on the theory of graphs
• I. Schur, C. E. Shannon and Ramsey numbers, a short story

This page was built for publication: An improved lower bound on multicolor Ramsey numbers