arXiv (All)
open access
Short Proofs for the Minimum Number of Determined Circles
We present short proofs for the main parts of the recently completed solution of Erdős Problem 506, which asks for the minimum number of distinct circles determined by a finite planar point set that is neither collinear nor concyclic. An inversion argument and a seven-point line lemma show that eigh
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
- A cyclic non-Ramsey heptagon#1049070
- What is the Cartesian Circle? Can Descartes be successfully defended against the charge of circular reasoning?#80004
- The density of long runs of non-$r$-free integers#1110345
- Counting degrees of vertices in near Goldbach graphs#630142
- Counting degrees of vertices in near Goldbach graphs#628280
Record · ID 1344741
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