arXiv (All)
open access
A short proof that $R(3,k)=Θ(k^2/\log k)$
We give a nibble-free construction proving $R(3,k)\ge(1/200+o(1))k^2/\log k$. We also include Shearer's proof bounding the independence number of a triangle-free graph, which implies $R(3,k)\le (1+o(1))(k^2/\log k)$.
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
- Eulerian triangle is totally positive of order 3#794036
- Eulerian triangle is totally positive of order 3#790017
- An improved lower bound for the van der Waerden number $w(3,k)$#1115754
- Quasi-uniform designs from random candidates: optimal candidate complexity and farthest-point sampling#973598
- The uniform Turán density of the tetrahedron#999488
Record · ID 822209
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