The labelled matching host has at most one neighbor per vertex
ProvedArexychen.Erdos180.matchingHost_isMatchingGrapharexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory
For every natural number , each vertex of the labelled graph with pairs has at most one neighbor: if it is adjacent to both and , then . Isolated vertices are permitted.
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.matchingHost_isMatchingGraph (n : ℕ) :
IsMatchingGraph (matchingHost n) := by sorry
Source