Erdős Problem #934
Statement
Let be minimal such that every graph with edges and maximal degree contains two edges whose shortest path between them has length . 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.