/-
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 166
References:
[Sp77] Spencer, J., Asymptotic lower bounds for Ramsey functions. Discrete Math. (1977), 69-76.
[AKS80] Ajtai, M., Komlós, J. and Szemerédi, E., A note on Ramsey numbers. J. Combin. Theory Ser. A (1980), 354-360.
[MaVe23] Mattheus, S. and Verstraëte, J., The asymptotics of $r(4,t)$. Ann. of Math. (2024), 941-965.
@[expose] public sectionopen Filternamespace Erdos166Prove that $$R(4,k) \gg \frac{k^3}{(\log k)^{O(1)}}.$$
This is true, and was proved by Mattheus and Verstraëte [MaVe23], who showed that $R(4,k) \gg \frac{k^3}{(\log k)^4}$. This problem is #5 in Ramsey Theory in the graphs problem collection.
The linked formal proof (Codex and GPT-5.6 Sol, via the construction of Bradač used for
Problem 920) gives k ^ 3 / (log k) ^ c = O(R(4, k)) for a natural c > 0, with the Ramsey
number defined through CliqueFree/IndepSetFree; this implies the statement below.
@[category research solved, question, AMS 5, formal_proof using lean4 at
"https://github.com/plby/lean-proofs/blob/8822f7ddef30fadbd92e1c6ab4ed897af356af5e/src/latest/ErdosProblems/Erdos166.lean#L83"]
theorem erdos_166 :
∃ (c C : ℝ), 0 < c ∧ 0 < C ∧
∀ᶠ (k : ℕ) in atTop,
(SimpleGraph.classicalRamsey 4 k : ℝ) ≥
C * (k : ℝ) ^ 3 / (Real.log k) ^ c := ⊢ ∃ c C, 0 < c ∧ 0 < C ∧ ∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ c
All goals completed! 🐙Mattheus and Verstraëte [MaVe23] proved the explicit lower bound $$R(4,k) \gg \frac{k^3}{(\log k)^4}.$$
@[category research solved, AMS 5]
theorem erdos_166.variants.mattheus_verstraete :
∃ C : ℝ, 0 < C ∧ ∀ᶠ (k : ℕ) in atTop,
(SimpleGraph.classicalRamsey 4 k : ℝ) ≥ C * (k : ℝ) ^ 3 / (Real.log k) ^ 4 := ⊢ ∃ C, 0 < C ∧ ∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ 4
All goals completed! 🐙
The bound of Mattheus and Verstraëte answers erdos_166, with logarithmic exponent $4$.
@[category test, AMS 5]
theorem erdos_166.variants.mattheus_verstraete_implies :
type_of% erdos_166.variants.mattheus_verstraete → type_of% erdos_166 := ⊢ (∃ C, 0 < C ∧ ∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ 4) →
∃ c C, 0 < c ∧ 0 < C ∧ ∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ c
C:ℝhC:0 < Ch:∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ 4⊢ ∃ c C, 0 < c ∧ 0 < C ∧ ∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ c
refine ⟨4, C, C:ℝhC:0 < Ch:∀ᶠ (k : ℕ) in atTop, ↑(SimpleGraph.classicalRamsey 4 k) ≥ C * ↑k ^ 3 / Real.log ↑k ^ 4⊢ 0 < 4 All goals completed! 🐙, hC, h.mono fun k hk ↦ ?_⟩
All goals completed! 🐙end Erdos166