arXiv (OAI Expanded)
open access
No-three-in-line sets on the checkerboard grid
The classical no-three-in-line problem asks for the largest number $D(n)$ of points that can be chosen from an $n\times n$ grid with no three collinear; it remains open whether the elementary upper bound $2n$ is always attainable. We study a checkerboard-restricted variant in which all chosen points
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
- Simplicial arrangements in real projective three-space revisited#785003
- Simplicial arrangements in real projective three-space revisited#783413
- Brown-Gerver-Ramsey Theorems in Small Dimensions#1034130
- An infinite walk in $\mathbb{N}^{16}$, using only unit steps, with no three collinear points#972824
- Decomposition of Geometric Set Systems and Graphs#1100229
Record · ID 1160707
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