Erdős Problem #1066
Statement
Let be a graph given by points in , where any two distinct points are at least distance apart, and we draw an edge between two points if they are distance apart. Let be maximal such that any such graph always has an independent set on at least vertices. Estimate , or perhaps .
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.