Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — for n≥2s+1n\ge2s+1n≥2s+1 the maximum number of edges with clique number ≤k\le k≤k and matching number ≤s\le s≤s is 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)}

Proved
TuranMatching.Clique.theorem_1_1

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

clique-numbererdos-gallaiextremal-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\ge2s+1n≥2s+1. Among all graphs on nnn vertices with clique number at most kkk and matching number at most sss, the maximum possible number of edges is

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)}.

That is:

  1. every such graph has at most 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)} edges, and
  2. some such graph has exactly that many edges.

Here t(2s+1,k)t(2s+1,k)t(2s+1,k) is the number of edges of the Turán graph T(2s+1,k)T(2s+1,k)T(2s+1,k), and g(n,k,s)g(n,k,s)g(n,k,s) is the number of edges of the complete kkk-partite graph G(n,k,s)G(n,k,s)G(n,k,s) with k−1k-1k−1 balanced classes of total size sss and one class of size n−sn-sn−s.

The theorem is a common generalization of Turán's theorem (the matching condition is void when n≤2s+1n\le2s+1n≤2s+1) and of the Erdős–Gallai theorem on graphs with bounded matching number (the clique condition is void when k≥2s+1k\ge2s+1k≥2s+1).

Formalization Note Clique number at most kkk is CliqueFree (k + 1); the matching number is defined in the Setting as a maximum over matching subgraphs. 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. "Maximum" is formalized as an upper bound together with an attaining graph.

Preamble
import Mathlib
import Definitions.Def_TuranMatching_Clique_Setting

open Finset SimpleGraph
Formal statement
namespace TuranMatching.Clique

theorem theorem_1_1 (n k s : ℕ) (hk : 2 ≤ k) (hn : 2 * s + 1 ≤ n) :
    (∀ (G : SimpleGraph (Fin n)) [DecidableRel G.Adj], Admissible k s G →
        #G.edgeFinset ≤ max (turanNum (2 * s + 1) k) (gNum n k s)) ∧
    ∃ (G : SimpleGraph (Fin n)) (_ : DecidableRel G.Adj), Admissible k s G ∧
        #G.edgeFinset = max (turanNum (2 * s + 1) k) (gNum n k s) := by sorry

end TuranMatching.Clique
Source
Alon and Frankl, Turán graphs with bounded matching number, arXiv:2210.15076v1, p. 1, Theorem 1.1
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