Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.2, p. 12 — the blow-up of a girth-5 graph by cliques of size c/2 is c-closed

Proved
CClosedGraphs.LowerBound.claim_4_2

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

blow-upc-closed-graphgirthp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a finite graph of girth at least 555, let h≥1h \ge 1h≥1 be an integer, and let H(h)H^{(h)}H(h) be the blow-up of HHH in which each vertex xxx becomes a clique UxU_xUx​ of hhh vertices, the bipartite graph between UxU_xUx​ and UyU_yUy​ is Kh,hK_{h,h}Kh,h​ minus a perfect matching when xy∈E(H)xy \in E(H)xy∈E(H), and there are no edges between UxU_xUx​ and UyU_yUy​ otherwise. Then, with c=2hc = 2hc=2h,

H(h) is c-closed.H^{(h)} \ \text{is } c\text{-closed}.H(h) is c-closed.

This is the first half of the lower-bound construction: the graph built from HHH satisfies the triadic-closure condition with parameter ccc.

Formalization Note The paper's ccc is even and ∣Ux∣=c/2|U_x| = c/2∣Ux​∣=c/2; here h=c/2h = c/2h=c/2 and the conclusion is stated for c=2hc = 2hc=2h. The paper builds H(h)H^{(h)}H(h) from one extremal girth-555 graph, but its proof uses only that HHH has girth at least 555, so the claim is stated for every such HHH (girth via Mathlib's egirth, ∞\infty∞ for forests). The perfect matching is fixed as (x,i)↔(y,i)(x,i) \leftrightarrow (y,i)(x,i)↔(y,i), one admissible choice in the paper's construction. For h=1h = 1h=1 the blow-up is edgeless and the claim is still true.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_LowerBound_Setting
Formal statement
namespace CClosedGraphs.LowerBound
theorem claim_4_2 {V : Type*} [Fintype V] [DecidableEq V] (H : SimpleGraph V) (h : ℕ)
    (hh : 1 ≤ h) (hH : 5 ≤ H.egirth) : CClosedGraphs.Peeling.IsCClosed (2 * h) (blowUp H h) := by sorry
end CClosedGraphs.LowerBound
Source
Fox, Roughgarden, Seshadhri, Wei and Wein, Finding cliques in social networks: a new distribution-free model, arXiv:1804.07431v1, p. 12, Claim 4.2
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