arXiv (All)
open access
New bounds for off-diagonal hypergraph Ramsey numbers
We study a conjecture of Conlon, Fox, Gunby, He, Mubayi, Suk, Verstraëte, and Yu, which characterizes the $3$-graphs $H$ for which the off-diagonal Ramsey number $r(H,n)$ is polynomial. We prove the conjecture for $3$-graphs with at most five tight components. Additionally, we show that the full con
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
- 4-cycle-free induced subgraphs of grid graphs#1325123
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- Generalized Zykov's Theorem#1082998
- Optimizing the CGMS upper bound on Ramsey numbers#793389
Record · ID 1325725
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