A lower bound for set‐coloring Ramsey numbers
From MaRDI portal
Publication:6119217
DOI10.1002/rsa.21173arXiv2212.06802MaRDI QIDQ6119217
Maurício Collares, Unnamed Author, Unnamed Author, Robert Morris, Taísa L. Martins
Publication date: 29 February 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.06802
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Lower bounds for multicolor Ramsey numbers
- Multicolor Ramsey numbers via pseudorandom graphs
- Sharp bounds for some multicolour Ramsey numbers
- On a Ramsey type theorem
- Recent developments in graph Ramsey theory
- A Ramsey‐type problem and the Turán numbers*
- An improved lower bound on multicolor Ramsey numbers
- Partition relations for cardinal numbers
- Hypergraph Ramsey numbers of cliques versus stars
- A note on pseudorandom Ramsey graphs
This page was built for publication: A lower bound for set‐coloring Ramsey numbers
