arXiv (All)
open access
Multicolor Ramsey numbers of odd cycles are superexponential
In a recent breakthrough, OpenAI proved that the $k$-color Ramsey number of the triangle $C_3$ grows super-exponentially, more precisely, they proved that $R_k(C_3)\ge k^{k/3-o(k)}$. In this short note, we present a modification of their recursive construction that works for multicolor Ramsey number
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- Multicolor Ramsey and list Ramsey numbers for star-like trees#973959
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#819736
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#809740
Record · ID 984214
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive