Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Structural constant-or-linear dichotomy for finite forest families

Proved
Arexychen.Erdos180.familiesTheoremStructural

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

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

Let FFF be a family of finite simple graphs indexed by a finite nonempty type. Suppose every reduced member, obtained by deleting isolated vertices, is acyclic and has at least two edges. Then exactly the following stated alternatives are classified:

(P(F)∧ex⁡F(n)=Θ(1))  ∨  (¬P(F)∧ex⁡F(n)=Θ(n)),\bigl(P(F)\land\operatorname{ex}_F(n)=\Theta(1)\bigr)\;\lor\;\bigl(\neg P(F)\land\operatorname{ex}_F(n)=\Theta(n)\bigr),(P(F)∧exF​(n)=Θ(1))∨(¬P(F)∧exF​(n)=Θ(n)),

where P(F)P(F)P(F) means that the family contains a reduced star with at least two edges and a reduced matching with at least two edges. The asymptotic comparisons are as natural n→∞n\to\inftyn→∞, with real casts. The extremal function forbids ordinary subgraph copies of the original members, including isolated vertices. This is a formalization of the forest/linear regime related to Erdős Problem #180, with no claim of mathematical novelty.

Preamble
import Definitions.Def_arexychen_erdos180_core
import Definitions.Def_arexychen_erdos180_families_bounds
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.DeleteEdges
import Mathlib.Combinatorics.SimpleGraph.Finite
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Matching
import Mathlib.Combinatorics.SimpleGraph.Subgraph
import Mathlib.Tactic

open Filter
open Asymptotics
universe u v w
open Arexychen.Erdos180
Formal statement
theorem Arexychen.Erdos180.familiesTheoremStructural
    {ι : Type v} [Finite ι] [Nonempty ι]
    (F : ι → FiniteSimpleGraph.{u})
    (hforest : ∀ i : ι, ((F i).reduced).IsAcyclic)
    (htwo : ∀ i : ι, (F i).atLeastTwoEdgesAfterDeletingIsolated) :
    (FamilyContainsStarMatchingPair F ∧
        IsThetaConstant (fun n : ℕ => extremalFamily F n)) ∨
      (¬ FamilyContainsStarMatchingPair F ∧
        IsThetaLinear (fun n : ℕ => extremalFamily F n)) := by sorry
Source
https://github.com/arexychen/Erdos180/blob/2ea42256708d02f5de1541b42cfbc1e1c00c7d03/Erdos180/Families/StructuralTheorem.lean#L79-L94

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