Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 6 — maximal cliques of types 1 and 2 number at most those of G \ {v}

Proved
CClosedGraphs.Peeling.types_one_two_le

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

c-closed-graphmaximal-cliquep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite simple graph, WWW a set of vertices and v∈Wv\in Wv∈W. Call a maximal clique KKK of G[W]G[W]G[W] of type 1 if v∉Kv\notin Kv∈/K, and of type 2 if v∈Kv\in Kv∈K and K∖{v}K\setminus\{v\}K∖{v} is a maximal clique of G[W∖{v}]G[W\setminus\{v\}]G[W∖{v}]. Then

#{K:K a maximal clique of G[W] of type 1 or 2} ≤ mc(G[W∖{v}]).\#\{K : K \text{ a maximal clique of } G[W] \text{ of type 1 or 2}\}\ \le\ \mathrm{mc}(G[W\setminus\{v\}]).#{K:K a maximal clique of G[W] of type 1 or 2} ≤ mc(G[W∖{v}]).

In the paper (W=VW=VW=V, G∖{v}=G[V∖{v}]G\setminus\{v\}=G[V\setminus\{v\}]G∖{v}=G[V∖{v}]) this is the step "the number of maximal cliques of types 1 and 2 combined is at most F(n−1,c)F(n-1,c)F(n−1,c)" of the peeling argument. It holds for every graph; no closure hypothesis is involved.

Formalization Note The induced subgraph G∖{v}G\setminus\{v\}G∖{v} of the current graph G[W]G[W]G[W] is G[W∖{v}]G[W\setminus\{v\}]G[W∖{v}]; the right-hand side is the actual number of maximal cliques of that graph, which is at most the paper's F(∣W∣−1,c)F(|W|-1,c)F(∣W∣−1,c) when G[W]G[W]G[W] is ccc-closed.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Peeling_Setting
Formal statement
namespace CClosedGraphs.Peeling
open Classical in
theorem types_one_two_le {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (W : Set V) (v : V) (hv : v ∈ W) :
    ((maxCliquesIn G W).filter
        (fun K => v ∉ K ∨ K.erase v ∈ maxCliquesIn G (W \ {v}))).card
      ≤ numMaxCliquesIn G (W \ {v}) := by sorry
end CClosedGraphs.Peeling
Source
Fox, Roughgarden, Seshadhri, Wei and Wein, Finding cliques in social networks: a new distribution-free model, arXiv:1804.07431v1, p. 6, §2.1, proof of Theorem 2.1 (types 1–3 and the bound on types 1 and 2)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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