arXiv (All)
open access
Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory
Let $K$ be a $1$-separated set of diameter at most $R-1$, and let $\ell_m$ denote a collection of $m$ points on a line, with consecutive points of distance $1$ apart. Conlon and Fox (2019) demonstrated a coloring of $n$-dimensional Euclidean space avoiding red congruent copies of $\ell_2$ and blue c
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
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#809406
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- On the Stability of the Independence Number in Random Distance Graphs#986522
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
Record · ID 819399
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