Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inequality (4) and its consequence, p. 10 — cliques meeting N(v) ∪ {v} number at most F₀(Δ, c−1) min{Δ, n/Δ} 2^c

Proved
CClosedGraphs.Improved.case_2_count

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

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

Let c≥2c\ge2c≥2, let G[W]G[W]G[W] be ccc-closed with n=∣W∣n=|W|n=∣W∣ vertices, let Δ≥1\Delta\ge1Δ≥1 bound the degree in G[W]G[W]G[W] of every vertex of WWW, and let v∈Wv\in Wv∈W have degree exactly Δ\DeltaΔ in G[W]G[W]G[W], and assume Δ>n\Delta>\sqrt nΔ>n​ (Case 2). Assume the inductive hypothesis at level c−1c-1c−1: every non-empty vertex set W′W'W′ with G[W′]G[W']G[W′] (c−1)(c-1)(c−1)-closed satisfies mc(G[W′])≤F0(∣W′∣,c−1)\mathrm{mc}(G[W'])\le F_0(|W'|,c-1)mc(G[W′])≤F0​(∣W′∣,c−1). Then the number of maximal cliques of G[W]G[W]G[W] that contain at least one vertex of N(v)∪{v}N(v)\cup\{v\}N(v)∪{v} satisfies

#{K maximal clique of G[W]:K∩(N(v)∪{v})≠∅}  <  F0(Δ,c−1) min⁡{Δ,nΔ} 2c.\#\{K \text{ maximal clique of } G[W] : K\cap(N(v)\cup\{v\})\ne\emptyset\}\;<\;F_0(\Delta,c-1)\,\min\Big\{\Delta,\frac{n}{\Delta}\Big\}\,2^{c}.#{K maximal clique of G[W]:K∩(N(v)∪{v})=∅}<F0​(Δ,c−1)min{Δ,Δn​}2c.

This combines inequality (4), ∣K∣≤min⁡{Δ,n/Δ}2c−1F0(Δ,c−1)|\mathcal K|\le\min\{\Delta,n/\Delta\}2^{c-1}F_0(\Delta,c-1)∣K∣≤min{Δ,n/Δ}2c−1F0​(Δ,c−1), with the bound F0(Δ,c−1)F_0(\Delta,c-1)F0​(Δ,c−1) on the cliques through vvv. It is the high-degree step of the recurrence for F(n,c)F(n,c)F(n,c).

Formalization Note The inductive hypothesis is an explicit premise and requires W′W'W′ non-empty: the empty graph has one maximal clique while F0(0,c−1)=0F_0(0,c-1)=0F0​(0,c−1)=0. All quantities on the right are real numbers; n/Δn/\Deltan/Δ is real division.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
open Classical in
theorem case_2_count {V : Type*} [Fintype V] [DecidableEq V] {c : ℕ} (hc : 2 ≤ c)
    {G : SimpleGraph V} {W : Set V} (hW : IsCClosedOn c G W) {v : V} (hv : v ∈ W)
    (Δ : ℕ) (hΔpos : 1 ≤ Δ) (hΔ : ∀ x ∈ W, (W ∩ G.neighborSet x).ncard ≤ Δ)
    (hv_deg : (W ∩ G.neighborSet v).ncard = Δ)
    (hcase : Real.sqrt (W.ncard : ℝ) < (Δ : ℝ))
    (hIH : ∀ W' : Set V, W'.Nonempty → IsCClosedOn (c - 1) G W' →
      (CClosedGraphs.Peeling.numMaxCliquesIn G W' : ℝ) ≤ F0 (W'.ncard : ℝ) (c - 1)) :
    ((((CClosedGraphs.Peeling.maxCliquesIn G W).filter (fun K => v ∈ K ∨ ∃ y ∈ K, G.Adj v y)).card : ℕ) : ℝ) <
      F0 (Δ : ℝ) (c - 1) * min (Δ : ℝ) ((W.ncard : ℝ) / (Δ : ℝ)) * 2 ^ 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. 10, proof of Theorem 3.1, Case 2, inequality (4) and the display 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