/-
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.
-/
import FormalConjecturesUtilErdős Problem 920
References:
[Br26] D. Brada\v{c}, Nearly tight exponents for off-diagonal Ramsey numbers. arXiv:2605.28793 (2026).
[Er69b] Erdős, P., Problems and results in chromatic graph theory. Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968) (1969), 27-35.
[GrYa68] Graver, Jack E. and Yackel, James, Some graph theoretic results associated with Ramsey's theorem. J. Combinatorial Theory (1968), 125--175.
[MaVe23] Mattheus, S. and Verstraete, J., The asymptotics of $r(4,t)$. arXiv:2306.04007 (2023).
open Real Filternamespace Erdos920$f_k(n)$ is the maximum possible chromatic number of a graph with $n$ vertices which contains no $K_k$.
noncomputable def f (k n : ℕ) : ℕ :=
sSup {(G.chromaticNumber) | (G : SimpleGraph (Fin n)) (_ : G.CliqueFree k)}Is it true that, for $k\geq 4$, $f_k(n) \gg \frac{n^{1-\frac{1}{k-1}}}{(\log n)^{c_k}}$ for some constant $c_k>0$?
This problem follows immediately from Mattheus and Verstraete's lower bound [MaVe23] for k = 4 and Bradač's lower bound [Br26] for k ≥ 5.
@[category research solved, AMS 5]
theorem erdos_920 :
answer(True) ↔ ∀ k : ℕ, k ≥ 4 → ∃ c > 0,
(fun n ↦ f k n) ≫ (fun n ↦ (n : ℝ) ^ (1 - 1 / ((k : ℝ) - 1)) / (log n) ^ c) := ⊢ True ↔ ∀ k ≥ 4, ∃ c > 0, (fun n ↦ ↑n ^ (1 - 1 / (↑k - 1)) / log ↑n ^ c) =O[atTop] fun n ↦ ↑(f k n)
All goals completed! 🐙Graver and Yackel [GrYa68] proved that $f_k(n) \ll \left(n\frac{\log\log n}{\log n}\right)^{1-\frac{1}{k-1}}.$
@[category research solved, AMS 5]
theorem erdos_920.variants.upper_bound (k : ℕ) (hk : k ≥ 3) :
(fun n ↦ f k n) ≪ (fun n ↦ ((n : ℝ) * log (log n) / log n) ^ (1 - 1 / ((k : ℝ) - 1))) := k:ℕhk:k ≥ 3⊢ (fun n ↦ ↑(f k n)) =O[atTop] fun n ↦ (↑n * log (log ↑n) / log ↑n) ^ (1 - 1 / (↑k - 1))
All goals completed! 🐙It is known that $f_3(n)\asymp (n/\log n)^{1/2}$ (see [erdosproblems.com/1104]).
@[category research solved, AMS 5]
theorem erdos_920.variants.k_eq_3 :
(fun n ↦ (f 3 n : ℝ)) =Θ[atTop] (fun n ↦ ((n : ℝ) / log n) ^ (1 / 2 : ℝ)) := ⊢ (fun n ↦ ↑(f 3 n)) =Θ[atTop] fun n ↦ (↑n / log ↑n) ^ (1 / 2)
All goals completed! 🐙The lower bound $R(4,m) \gg m^3/(\log m)^4$ of Mattheus and Verstraete [MaVe23] (see [erdosproblems.com/166]) implies $f_4(n) \gg \frac{n^{2/3}}{(\log n)^{4/3}}$.
@[category research solved, AMS 5]
theorem erdos_920.variants.lower_bound_k_eq_4 :
(fun n ↦ f 4 n) ≫ (fun n ↦ (n : ℝ) ^ (2 / 3 : ℝ) / (log n) ^ (4 / 3 : ℝ)) := ⊢ (fun n ↦ ↑n ^ (2 / 3) / log ↑n ^ (4 / 3)) =O[atTop] fun n ↦ ↑(f 4 n)
All goals completed! 🐙A positive answer to this question for all $k\geq 5$ follows from the lower bound in [erdosproblems.com/986] given by Bradač [Br26].
@[category research solved, AMS 5]
theorem erdos_920.variants.lower_bound_k_ge_5 (k : ℕ) (hk : k ≥ 3) :
∃ c > 0, (fun n ↦ f k n) ≫ (fun (n : ℕ) ↦
(n : ℝ) ^ (1 - 2 / ((k : ℝ) + 1)) / (log n) ^ c) := k:ℕhk:k ≥ 3⊢ ∃ c > 0, (fun n ↦ ↑n ^ (1 - 2 / (↑k + 1)) / log ↑n ^ c) =O[atTop] fun n ↦ ↑(f k n)
All goals completed! 🐙end Erdos920