Problem 614

../

claims/: The 1 claim page of Problem 614, one per claimant's result; the problem's standing derives from them.

---

Statement. 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$. Determine $f(n,k)$.

Status. Open.

Source. erdosproblems.com/614, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #614, https://www.erdosproblems.com/614.

Formalization. None recorded.

Progress

Not yet compiled.

Known Results

Not yet compiled.