Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 1, Theorem 1.1 (lower bound); p. 5 — G(n,k,s)G(n,k,s)G(n,k,s) and T(2s+1,k)T(2s+1,k)T(2s+1,k) plus isolated vertices are admissible

Proved
TuranMatching.Clique.extremal_graphs_admissible

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

extremal-graph-theorymatching-numberp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1turan-number

Let k≥2k\ge2k≥2, s≥0s\ge0s≥0 and n≥2s+1n\ge 2s+1n≥2s+1. Then:

  1. the graph G(n,k,s)G(n,k,s)G(n,k,s) has clique number at most kkk and matching number at most sss;
  2. there is a graph on nnn vertices with clique number at most kkk and matching number at most sss that has exactly t(2s+1,k)t(2s+1,k)t(2s+1,k) edges.

Hence

max⁡{t(2s+1,k), g(n,k,s)}\max\{t(2s+1,k),\,g(n,k,s)\}max{t(2s+1,k),g(n,k,s)}

is a lower bound for the maximum number of edges of an nnn-vertex graph with clique number at most kkk and matching number at most sss. This is the lower-bound half of Theorem 1.1; the natural witness for (2) is the Turán graph T(2s+1,k)T(2s+1,k)T(2s+1,k) on 2s+12s+12s+1 of the vertices with the remaining n−2s−1n-2s-1n−2s−1 vertices isolated.

Formalization Note The paper says "every kkk"; the restriction k≥2k\ge2k≥2 is needed because G(n,k,s)G(n,k,s)G(n,k,s) has k−1k-1k−1 classes of total size sss, which is impossible for k=1k=1k=1 and s>0s>0s>0, and no graph on n≥1n\ge1n≥1 vertices has clique number at most 000.

Preamble
import Mathlib
import Definitions.Def_TuranMatching_Clique_Setting

open Finset SimpleGraph
Formal statement
namespace TuranMatching.Clique

theorem extremal_graphs_admissible (n k s : ℕ) (hk : 2 ≤ k) (hn : 2 * s + 1 ≤ n) :
    Admissible k s (bigGraph n k s) ∧
    ∃ (G : SimpleGraph (Fin n)) (_ : DecidableRel G.Adj), Admissible k s G ∧
        #G.edgeFinset = turanNum (2 * s + 1) k := by sorry

end TuranMatching.Clique
Source
Alon and Frankl, Turán graphs with bounded matching number, arXiv:2210.15076v1, p. 1, Theorem 1.1 (the lower bound); p. 5, proof of Proposition 3.1, first two sentences
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me