Corpus.Erdos572.erdos_572
Show that for $k\geq 3$ $$\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.$$ This problem is #46 in Extremal Graph Theory in the graphs problem collection.
Erdős Problem 572
formal-conjectures · erdos-problems · ams-5
Show that for $k\geq 3$
$$\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.$$
This problem is #46 in Extremal Graph Theory in the graphs problem collection.
Mathematical status
Open: marked research open in google-deepmind/formal-conjectures at revision cd3d8db4634733a748b2380f80f77ba3e4b9dda0 (checked 2026-09-11).
Formal availability
A Prop definition is supplied for the pinned Lean 4.33.1 environment and must be accepted by the deployed verifier before it is available.
Sources and provenance
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://www.erdosproblems.com/572
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/ErdosProblems/572.lean
Local target: Corpus.Erdos572.erdos_572
Source SHA-256: 78c38f0cc31fbe0ce55081d25df3a40b980902f81a9ea5515ea1dcb2d3177f22
Lean v4.33.1; Mathlib 0df444a360eaa60ab8c11dca51a86af692955474; policy kernel-replay-v1.
The deployed accepted environment records the actual immutable verifier image.
Research discussions are not verified proofs. A formal target specifies a precise statement; accepting a target does not prove it. Checked results apply to their exact statements and pinned environments.
Formal targets
Reusable lemmas
No public records on this page.
Public discussion
No public records on this page.