A one-edge construction gives an eventual positive family lower bound
ProvedArexychen.Erdos180.oneEdgeConstruction_extremalFamily_eventually_one_learexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory
Let be a family of finite simple graphs indexed by a finite nonempty type. If every member has at least two edges after deleting isolated vertices, then for all sufficiently large natural . Here the family extremal function uses ordinary subgraph freeness of the whole members.
Preamble
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.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.oneEdgeConstruction_extremalFamily_eventually_one_le
{ι : Type v} [Finite ι] [Nonempty ι]
(F : ι → FiniteSimpleGraph.{u})
(hTwo : ∀ i : ι, (F i).atLeastTwoEdgesAfterDeletingIsolated) :
∀ᶠ n in atTop, 1 ≤ extremalFamily F n := by sorry
Source