arXiv (All)
open access
On the multicolour Ramsey numbers $R(3,3,k)$
In this paper we determine the Ramsey number $R(3,3,k)$ up to a constant factor, showing that $$R(3,3,k) = Θ\bigg( \frac{k^3}{(\log k)^2} \bigg).$$ The proof of the lower bound combines the Hefty-Horn-King-Pfender construction for $R(3,k)$ with the method of Alon and Rödl. Using the same proof, we a
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
- Sparse chromatic graphs and the complete-graph triangle bound#1062147
- More on Rainbow Cliques in Edge-Colored Graphs#1122876
- A twelve-term exclusion for the small Davenport constant of $E_2\times C_3^r$#1048367
- Eleven, twelve, and thirteen lonely runners#819353
- Eleven, twelve, and thirteen lonely runners#809360
Record · ID 1075925
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