An improved lower bound for multicolor Ramsey numbers and a problem of Erdős

DOI10.1016/j.jcta.2021.105579zbMath1483.05100OpenAlexW4200278717WikidataQ114162661 ScholiaQ114162661MaRDI QIDQ2077262

William F. Sawin

Publication date: 24 February 2022

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2021.105579

zbMATH Keywords

graph coloringRamsey theoryRamsey numbersprobabilistic methodRamsey multiplicitymulticolor Ramsey numbers

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ A lower bound for set‐coloring Ramsey numbers ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Ramsey multiplicity of complete graphs
• A problem of Erdős on the minimum number of \(k\)-cliques
• Graph complexity
• Lower bounds for multicolor Ramsey numbers
• Multicolor Ramsey numbers via pseudorandom graphs
• Sharp bounds for some multicolour Ramsey numbers
• On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
• Recent developments in graph Ramsey theory
• On Sets of Acquaintances and Strangers at any Party
• An improved lower bound on multicolor Ramsey numbers
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Quasi-random graphs

This page was built for publication: An improved lower bound for multicolor Ramsey numbers and a problem of Erdős