Erdős Problem #1084
Statement
Let be minimal such that in any collection of points in , all of distance at least apart, there are at most many pairs of points which are distance apart. Estimate .
Record
- Source
- Added
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.