Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 8 — a c-closed graph on n vertices has at most 4^{(c+4)(c−1)/2} n^{2−2^{1−c}} maximal cliques

Proved
CClosedGraphs.Improved.theorem_3_1

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

c-closed-graphextremal-graph-theorymaximal-cliquep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ccc and nnn be positive integers and let GGG be a ccc-closed graph on nnn vertices, that is, any two distinct vertices with at least ccc common neighbours are adjacent. Then the number mc(G)\mathrm{mc}(G)mc(G) of maximal cliques of GGG satisfies

mc(G)  ≤  4(c+4)(c−1)/2 n 2−21−c.\mathrm{mc}(G)\;\le\;4^{(c+4)(c-1)/2}\,n^{\,2-2^{1-c}}.mc(G)≤4(c+4)(c−1)/2n2−21−c.

Equivalently F(n,c)≤4(c+4)(c−1)/2n2−21−cF(n,c)\le 4^{(c+4)(c-1)/2}n^{2-2^{1-c}}F(n,c)≤4(c+4)(c−1)/2n2−21−c, where F(n,c)F(n,c)F(n,c) is the maximum number of maximal cliques of a ccc-closed graph on nnn vertices. For fixed ccc the bound is O(n2−21−c)O(n^{2-2^{1-c}})O(n2−21−c): O(n)O(n)O(n) for c=1c=1c=1, O(n3/2)O(n^{3/2})O(n3/2) for c=2c=2c=2, O(n7/4)O(n^{7/4})O(n7/4) for c=3c=3c=3, which together with the bound 3(c−1)/3n23^{(c-1)/3}n^23(c−1)/3n2 of Theorem 2.1 gives Theorem 1.4.

Formalization Note The vertex set is Fin n. A maximal clique is a vertex set that is a clique and is not contained in a larger clique. Both powers are real powers.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
theorem theorem_3_1 (c n : ℕ) (hc : 0 < c) (hn : 0 < n) (G : SimpleGraph (Fin n))
    (hG : CClosedGraphs.Peeling.IsCClosed c G) :
    (CClosedGraphs.Peeling.numMaxCliques G : ℝ) ≤
      (4 : ℝ) ^ (((c : ℝ) + 4) * ((c : ℝ) - 1) / 2) *
        (n : ℝ) ^ ((2 : ℝ) - (2 : ℝ) ^ (1 - (c : ℝ))) := by sorry
end CClosedGraphs.Improved
Source
Fox, Roughgarden, Seshadhri, Wei and Wein, Finding cliques in social networks: a new distribution-free model, arXiv:1804.07431v1, p. 8, Theorem 3.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