Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A reduced forest with at least two edges has linear extremal growth

Proved
Arexychen.Erdos180.isThetaLinear_extremal_of_reduced_isAcyclic_of_atLeastTwo

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

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

Let HHH be a finite simple graph whose induced graph on non-isolated vertices is acyclic and has at least two edges. Its extremal function for ordinary subgraph freeness of the original HHH satisfies

ex⁡H(n)=Θ(n)(n→∞).\operatorname{ex}_H(n)=\Theta(n)\qquad(n\to\infty).exH​(n)=Θ(n)(n→∞).

The comparison is at the natural-number at-top filter after casting the extremal values and nnn to real numbers; it gives eventual positive constant upper and lower linear bounds.

Preamble
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.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
attribute [local instance] SimpleGraph.neighborSetFintype
universe u v
open Arexychen.Erdos180
Formal statement
theorem Arexychen.Erdos180.isThetaLinear_extremal_of_reduced_isAcyclic_of_atLeastTwo
    (H : FiniteSimpleGraph.{u})
    (hforest : H.reduced.IsAcyclic)
    (htwo : H.atLeastTwoEdgesAfterDeletingIsolated) :
    IsThetaLinear (fun n => H.extremal n) := by sorry
Source
https://github.com/arexychen/Erdos180/blob/2ea42256708d02f5de1541b42cfbc1e1c00c7d03/Erdos180/Forest.lean#L491-L506

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