arXiv (OAI Expanded)
open access
Retained-Set Descent for Diagonal Ramsey Numbers
We study how far a fixed Ramsey upper bound can be improved by descending through blue neighborhoods in one vertex set while keeping a second set fixed. A weighted inequality in the two set sizes determines when the descent can stop. For the source bound specified here, the infimum diagonal exponent
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
- Optimizing the CGMS upper bound on Ramsey numbers#793389
- Optimizing the CGMS upper bound on Ramsey numbers#789385
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#819399
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#809406
Record · ID 1084471
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