Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Indexed forbidden families and the star–matching pair predicate

Definition
arexychen_erdos180_families_bounds

by arexychen · Sep 9, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory

For an indexed family FFF, family freeness means that every member is absent as an ordinary subgraph of the host. For finite index types, the family extremal function is the natural supremum of edge counts of family-free graphs on Fin⁡(n)\operatorname{Fin}(n)Fin(n). The pair predicate asserts existence of an index with a reduced star of at least two edges and an index with a reduced matching of at least two edges. It does not add a distinct-index hypothesis or replace the indexed family with a finite set.

Definition code
import Definitions.Def_arexychen_erdos180_core
import Definitions.Def_arexychen_erdos180_finite
import Mathlib.Analysis.Asymptotics.Theta
import Mathlib.Combinatorics.SimpleGraph.Acyclic
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Finite
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Matching
import Mathlib.Combinatorics.SimpleGraph.Subgraph
import Mathlib.Tactic

namespace Arexychen


open Filter
open Asymptotics

noncomputable section

namespace Erdos180

attribute [local instance] SimpleGraph.neighborSetFintype

universe u v w





/-- A host graph avoids every member of a finite indexed family. -/
def FamilyFree {ι : Type v}
    (F : ι → FiniteSimpleGraph.{u})
    {W : Type w}
    (G : SimpleGraph W) : Prop :=
  ∀ i : ι, IsHFree (F i).graph G

/-- The extremal number for a finite indexed family of forbidden graphs. -/
def extremalFamily {ι : Type v} [Finite ι]
    (F : ι → FiniteSimpleGraph.{u}) (n : ℕ) : ℕ :=
  sSup {m : ℕ | ∃ G : SimpleGraph (Fin n), FamilyFree F G ∧ edgeCount G = m}









/-- The family contains both a star and a matching, each with at least two edges
after deleting isolated vertices. -/
def FamilyContainsStarMatchingPair {ι : Type v}
    (F : ι → FiniteSimpleGraph.{u}) : Prop :=
  (∃ i : ι, (F i).starWithAtLeastTwoEdgesAfterDeletingIsolated) ∧
    (∃ j : ι, (F j).matchingWithAtLeastTwoEdgesAfterDeletingIsolated)

end Erdos180

end
end Arexychen
Source
https://github.com/arexychen/Erdos180/blob/2ea42256708d02f5de1541b42cfbc1e1c00c7d03/Erdos180/Families/Bounds.lean#L71-L157

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