Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 2.2, p. 3 — if non-adjacent vertices of BBB share neighbourhoods and GGG is Kk+1K_{k+1}Kk+1​-free, GBG_BGB​ is complete kkk-partite

Proved
TuranMatching.Clique.induced_complete_k_partite

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

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

Let k≥2k\ge2k≥2, let GGG be a graph on nnn vertices with no clique on k+1k+1k+1 vertices, and let BBB be a set of vertices such that every two non-adjacent vertices of BBB have the same neighbourhood in GGG. Then the induced subgraph GBG_BGB​ is complete kkk-partite: there is a map cls\mathrm{cls}cls from the vertices to {1,…,k}\{1,\dots,k\}{1,…,k} such that for all u,v∈Bu,v\in Bu,v∈B,

uv∈E(G)  ⟺  cls(u)≠cls(v).uv\in E(G)\iff \mathrm{cls}(u)\ne\mathrm{cls}(v).uv∈E(G)⟺cls(u)=cls(v).

Some of the kkk classes may be empty, as the paper allows. This is the first step of the proof of Lemma 2.2.

Formalization Note The classes are encoded by a map into Fin k; its values outside BBB are irrelevant. The hypothesis k≥2k\ge2k≥2 is the standing restriction of the formalization (some k≥1k\ge1k≥1 is needed for a map into {1,…,k}\{1,\dots,k\}{1,…,k} to exist).

Preamble
import Mathlib
import Definitions.Def_TuranMatching_Clique_Setting

open Finset SimpleGraph
Formal statement
namespace TuranMatching.Clique

theorem induced_complete_k_partite (n k : ℕ) (hk : 2 ≤ k)
    (G : SimpleGraph (Fin n)) (hK : G.CliqueFree (k + 1)) (B : Finset (Fin n))
    (hsame : ∀ u ∈ B, ∀ v ∈ B, ¬ G.Adj u v → G.neighborSet u = G.neighborSet v) :
    ∃ cls : Fin n → Fin k, ∀ u ∈ B, ∀ v ∈ B, G.Adj u v ↔ cls u ≠ cls v := by sorry

end TuranMatching.Clique
Source
Alon and Frankl, Turán graphs with bounded matching number, arXiv:2210.15076v1, p. 3, proof of Lemma 2.2, 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