Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, pp. 7–8 — peeling a vertex in no bad pair: F(n, c) ≤ F(n − 1, c) + 3^{(c−1)/3} n

Proved
CClosedGraphs.Peeling.peel_step

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

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

Let ccc be a positive integer, GGG a finite simple graph, WWW a set of vertices and v∈Wv\in Wv∈W a vertex that is in no bad pair of G[W]G[W]G[W], i.e. every u∈Wu\in Wu∈W, u≠vu\ne vu=v, not adjacent to vvv has fewer than ccc common neighbours with vvv inside WWW. Then

mc(G[W]) ≤ mc(G[W∖{v}])+3(c−1)/3 ∣W∣.\mathrm{mc}(G[W])\ \le\ \mathrm{mc}(G[W\setminus\{v\}]) + 3^{(c-1)/3}\,|W|.mc(G[W]) ≤ mc(G[W∖{v}])+3(c−1)/3∣W∣.

This is the recursive inequality F(n,c)≤F(n−1,c)+3(c−1)/3nF(n,c)\le F(n-1,c)+3^{(c-1)/3}nF(n,c)≤F(n−1,c)+3(c−1)/3n of the proof of Theorem 2.1, in the form of the remark after it: "the proof is valid as long as ∣N(u)∩N(v)∣<c|N(u)\cap N(v)|<c∣N(u)∩N(v)∣<c for all vertices u∉N(v)u\notin N(v)u∈/N(v)", so each recursive level only needs a vertex in no bad pair. Iterating it along the ordering of a weakly ccc-closed graph proves Theorem 2.2.

Formalization Note The paper's nnn is ∣W∣|W|∣W∣, the number of vertices of the current graph G[W]G[W]G[W]; 3(c−1)/33^{(c-1)/3}3(c−1)/3 is a real power.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Peeling_Setting
Formal statement
namespace CClosedGraphs.Peeling
theorem peel_step {V : Type*} [Fintype V] [DecidableEq V] (c : ℕ) (hc : 0 < c)
    (G : SimpleGraph V) (W : Set V) (v : V) (hv : v ∈ W)
    (hbad : ∀ w : V, ¬ IsBadPairIn c G W v w) :
    (numMaxCliquesIn G W : ℝ) ≤
      (numMaxCliquesIn G (W \ {v}) : ℝ) + (3 : ℝ) ^ (((c : ℝ) - 1) / 3) * (W.ncard : ℝ) := 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, pp. 7–8, §2.1, proof of Theorem 2.1 (recursive inequality) and the remark after it
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