The labelled matching host has edges
ProvedArexychen.Erdos180.edgeCount_matchingHostarexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory
For every natural number , the graph on consisting of the disjoint pairs has exactly unordered edges. An odd last vertex is isolated; the assertion also includes and .
Preamble
import Definitions.Def_arexychen_erdos180_core import Definitions.Def_arexychen_erdos180_families_matching 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_matchingHost (n : ℕ) :
edgeCount (matchingHost n) = n / 2 := by sorry
Source