arXiv (All)
open access
An infinite small-step $\mathbb Z^3$-walk with no collinear triple
We construct an infinite walk in $\mathbb{Z}^3$ whose steps come from a fixed set of sixteen vectors and no three of whose vertices are collinear, answering a problem of Gerver and Ramsey popularized as Erdős Problem 193.
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
- Towards a more structured search for Erdős-Gyárfás counter-examples#1076250
- Boxicity and Cubicity of Divisor Graphs and Power Graphs#635564
- Boxicity and Cubicity of Divisor Graphs and Power Graphs#633215
- The coarse Erdős-Pósa theorem#1077343
- Reduction Operations and Characterizations of $S^1$-Flows in Graphs#1012310
Record · ID 822193
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