Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 7 (cites [45]) — any k-vertex graph has at most 3^{k/3} maximal cliques

Proved
CClosedGraphs.Peeling.moon_moser

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

extremal-graph-theorymaximal-cliquemoon-moserp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite simple graph and WWW a set of kkk of its vertices. The induced subgraph G[W]G[W]G[W] has at most 3k/33^{k/3}3k/3 maximal cliques:

mc(G[W]) ≤ 3∣W∣/3.\mathrm{mc}(G[W])\ \le\ 3^{|W|/3}.mc(G[W]) ≤ 3∣W∣/3.

This is the bound of Moon and Moser (1965) on the number of maximal cliques of a kkk-vertex graph, in the form used on p. 7 of the paper, where it is applied to the induced subgraphs G[N(u)∩N(v)]G[N(u)\cap N(v)]G[N(u)∩N(v)] of fewer than ccc vertices. Taking WWW to be all vertices gives the bound 3∣V∣/33^{|V|/3}3∣V∣/3 for GGG itself.

Formalization Note Stated for induced subgraphs G[W]G[W]G[W] (the relative form the proof applies); the exponent ∣W∣/3|W|/3∣W∣/3 is a real number and the power is the real power. The sharp Moon–Moser values are not claimed.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Peeling_Setting
Formal statement
namespace CClosedGraphs.Peeling
theorem moon_moser {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (W : Set V) :
    (numMaxCliquesIn G W : ℝ) ≤ (3 : ℝ) ^ ((W.ncard : ℝ) / 3) := 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, proof of Theorem 2.1 (citing Moon and Moser [45])
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