Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 7, (1) — type-3 cliques number at most Σ_u F(|N(u) ∩ N(v)|, c)

Proved
CClosedGraphs.Peeling.ineq_1

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. The number of maximal cliques KKK of G[W]G[W]G[W] of type 3 (v∈Kv\in Kv∈K and K∖{v}K\setminus\{v\}K∖{v} not maximal in G[W∖{v}]G[W\setminus\{v\}]G[W∖{v}]) satisfies

#{type-3 maximal cliques of G[W]} ≤ ∑u∈W∖(N(v)∪{v})mc(G[W∩N(u)∩N(v)]).\#\{\text{type-3 maximal cliques of } G[W]\}\ \le\ \sum_{u\in W\setminus(N(v)\cup\{v\})} \mathrm{mc}\big(G[W\cap N(u)\cap N(v)]\big).#{type-3 maximal cliques of G[W]} ≤ u∈W∖(N(v)∪{v})∑​mc(G[W∩N(u)∩N(v)]).

This is inequality (1) of the paper, with each F(∣N(u)∩N(v)∣,c)F(|N(u)\cap N(v)|,c)F(∣N(u)∩N(v)∣,c) replaced by the actual number of maximal cliques of G[N(u)∩N(v)]G[N(u)\cap N(v)]G[N(u)∩N(v)], which is at most F(∣N(u)∩N(v)∣,c)F(|N(u)\cap N(v)|,c)F(∣N(u)∩N(v)∣,c) since induced subgraphs of a ccc-closed graph are ccc-closed. Combined with the Moon–Moser bound it gives the 3(c−1)/3n3^{(c-1)/3}n3(c−1)/3n term of the recursion.

Formalization Note The sum runs over the finite set of u∈Wu\in Wu∈W with u≠vu\neq vu=v and uuu not adjacent to vvv; neighbourhoods are taken in G[W]G[W]G[W].

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Peeling_Setting
Formal statement
namespace CClosedGraphs.Peeling
open Classical in
theorem ineq_1 {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
      ≤ ∑ u ∈ W.toFinset.filter (fun u => u ≠ v ∧ ¬ G.Adj v u),
          numMaxCliquesIn G (W ∩ G.commonNeighbors v u) := 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. 7, §2.1, display (1)
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