The labelled one-edge host has exactly one edge
ProvedArexychen.Erdos180.edgeCount_oneEdgeHostarexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory
For every natural number , the graph on with the sole unordered edge has edge count one. All other vertices are isolated.
Preamble
import Definitions.Def_arexychen_erdos180_core import Definitions.Def_arexychen_erdos180_families_oneedge 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.edgeCount_oneEdgeHost {n : ℕ} (hn : 2 ≤ n) :
edgeCount (oneEdgeHost n hn) = 1 := by sorry
Source