/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 614
References:
A problem on sparse induced subgraphs
[FRS97] Faudree, R. J., Rousseau, C. C. and Schelp, R. H., Problems in graph theory from Memphis. The Mathematics of Paul Erdős, II, 7–26.
@[expose] public sectionnamespace Erdos614def erdos_614.answer : ℕ → ℕ → ℕ := sorryopen scoped Classical inLet $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)$.
@[category research open, question value, AMS 5]
theorem erdos_614 :
∀ n k, IsLeast {m : ℕ | ∃ G : SimpleGraph (Fin n), G.edgeFinset.card = m ∧
∀ s : Finset (Fin n), s.card = k + 2 →
∃ v : s, k ≤ (G.induce (s : Set (Fin n))).degree v} (erdos_614.answer n k) := ⊢ ∀ (n k : ℕ),
IsLeast
{m |
∃ G,
G.edgeFinset.card = m ∧ ∀ (s : Finset (Fin n)), s.card = k + 2 → ∃ v, k ≤ (SimpleGraph.induce (↑s) G).degree v}
(erdos_614.answer n k)
All goals completed! 🐙end Erdos614