/-
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 712
References:
[Er81] Erdős, P., On the combinatorial problems which I would most like to see solved. Combinatorica (1981), 25-42.
@[expose] public sectionnamespace Erdos712open Filter Asymptoticsopen scoped Topologydef erdos_712.answer : ℕ → ℕ → ℝ := sorryDetermine, for any $k>r>2$, the limiting value as $n\to\infty$ of $$\frac{\mathrm{ex}_r(n,K_k^r)}{\binom{n}{r}},$$ where $\mathrm{ex}_r(n,K_k^r)$ is the largest number of $r$-edges which can placed on $n$ vertices so that there exists no set of $k$ vertices which is covered by all $\binom{k}{r}$ possible $r$-edges.
@[category research open, question value, AMS 5]
theorem erdos_712 :
∀ k r : ℕ, 2 < r → r < k →
Tendsto (fun n ↦ (Hypergraph.cliqueExtremalNumber n r k : ℝ) / n.choose r)
atTop (𝓝 (erdos_712.answer k r)) := ⊢ ∀ (k r : ℕ),
2 < r →
r < k → Tendsto (fun n ↦ ↑(Hypergraph.cliqueExtremalNumber n r k) / ↑(n.choose r)) atTop (𝓝 (erdos_712.answer k r))
All goals completed! 🐙The normalized extremal numbers have a limit in $[0,1]$. This existence result does not determine the value asked for in Erdős Problem 712.
@[category textbook, AMS 5]
theorem erdos_712.variants.limit_exists (r k : ℕ) :
∃ π ∈ Set.Icc (0 : ℝ) 1,
Tendsto (fun n : ℕ ↦ (Hypergraph.cliqueExtremalNumber n r k : ℝ) / n.choose r)
atTop (𝓝 π) := r:ℕk:ℕ⊢ ∃ π ∈ Set.Icc 0 1, Tendsto (fun n ↦ ↑(Hypergraph.cliqueExtremalNumber n r k) / ↑(n.choose r)) atTop (𝓝 π)
All goals completed! 🐙Turán's theorem gives the graph case: $\mathrm{ex}_2(n,K_k)/\binom{n}{2}\to 1-1/(k-1)$.
@[category research solved, AMS 5]
theorem erdos_712.variants.graph_case (k : ℕ) (hk : 2 ≤ k) :
Tendsto (fun n : ℕ ↦ (Hypergraph.cliqueExtremalNumber n 2 k : ℝ) / n.choose 2)
atTop (𝓝 (1 - 1 / ((k : ℝ) - 1))) := k:ℕhk:2 ≤ k⊢ Tendsto (fun n ↦ ↑(Hypergraph.cliqueExtremalNumber n 2 k) / ↑(n.choose 2)) atTop (𝓝 (1 - 1 / (↑k - 1)))
All goals completed! 🐙With denominator $n^2$, Turán's graph limit is $\frac12(1-1/(k-1))$. The factor $\frac12$ comes from the normalization.
@[category research solved, AMS 5]
theorem erdos_712.variants.graph_case_div_sq (k : ℕ) (hk : 2 ≤ k) :
Tendsto (fun n : ℕ ↦ (Hypergraph.cliqueExtremalNumber n 2 k : ℝ) / (n : ℝ) ^ 2)
atTop (𝓝 ((1 / 2) * (1 - 1 / ((k : ℝ) - 1)))) := k:ℕhk:2 ≤ k⊢ Tendsto (fun n ↦ ↑(Hypergraph.cliqueExtremalNumber n 2 k) / ↑n ^ 2) atTop (𝓝 (1 / 2 * (1 - 1 / (↑k - 1))))
All goals completed! 🐙end Erdos712