Erdős Problem #614 — Let f(n,k) be minimal such that there is a graph with n vertices and f(n,k) edges where every set of k+2 vertices induces a subgraph with maximum degree at least k.
Statement
Let be minimal such that there is a graph with vertices and edges where every set of vertices induces a subgraph with maximum degree at least . Determine .
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.