Erdős Problem #223 — Diameter pairs in Euclidean space
Statement
For , let be the largest number of pairs at distance 1 among points in whose diameter is 1. Determine or estimate .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.