Multicolor Ramsey numbers via pseudorandom graphs

DOI10.37236/9071zbMath1432.05067arXiv1910.06287OpenAlexW2980245002MaRDI QIDQ2294097

Yuval Wigderson, Xiaoyu He

Publication date: 10 February 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (9)

A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ A lower bound for set‐coloring Ramsey numbers ⋮ The asymptotics of \(r(4,t)\) ⋮ Cayley sum graphs and their applications to codebooks ⋮ Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs ⋮ An improved lower bound on multicolor 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
• Triangle factors in sparse pseudo-random graphs
• The early evolution of the \(H\)-free process
• A note on Ramsey numbers
• Explicit Ramsey graphs and orthonormal labelings
• Coloring graphs with sparse neighborhoods
• A construction for clique-free pseudorandom graphs
• Sharp bounds for some multicolour Ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Multicolor Ramsey numbers via pseudorandom graphs