Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A uniform linear edge bound for a forbidden reduced forest

Proved
Arexychen.Erdos180.edgeCount_le_of_isHFree_of_deleteIsolated_isAcyclic

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

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

Fix a finite simple graph HHH. If the graph induced by its non-isolated vertices is acyclic, there is a natural number CCC such that every finite simple graph GGG with decidable adjacency satisfies

H-free(G)  ⟹  e(G)≤C ∣V(G)∣.H\text{-free}(G)\;\Longrightarrow\;e(G)\le C\,|V(G)|.H-free(G)⟹e(G)≤C∣V(G)∣.

The constant is chosen before the host vertex type and host graph. Freeness forbids an injective edge-preserving copy of the whole original graph HHH, including its isolated vertices.

Preamble
import Definitions.Def_arexychen_erdos180_core
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.edgeCount_le_of_isHFree_of_deleteIsolated_isAcyclic
    {α : Type u} [Fintype α] (H : SimpleGraph α)
    (hforest : (deleteIsolated H).IsAcyclic) :
    ∃ C : ℕ, ∀ (β : Type v) [Fintype β] (G : SimpleGraph β)
      [DecidableRel G.Adj],
      IsHFree H G → edgeCount G ≤ C * Fintype.card β := by sorry
Source
https://github.com/arexychen/Erdos180/blob/2ea42256708d02f5de1541b42cfbc1e1c00c7d03/Erdos180/Forest.lean#L358-L369

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