A labelled one-edge host
Definitionarexychen_erdos180_families_oneedgearexychen-erdos180-migrationerdos-180extremal-graph-theorygraph-theory
For natural , define a simple graph on whose only unordered edge is . The remaining vertices are isolated. The proof that the two labelled endpoints differ is retained in the definition.
Definition code
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
namespace Arexychen
open Filter
open Asymptotics
noncomputable section
namespace Erdos180
universe u v w
/-- The labelled graph on `Fin n` with exactly the edge joining `0` and `1`.
The hypothesis `2 ≤ n` supplies the two distinct vertices. -/
def oneEdgeHost (n : ℕ) (hn : 2 ≤ n) : SimpleGraph (Fin n) :=
SimpleGraph.fromEdgeSet
({s((⟨0, by omega⟩ : Fin n), (⟨1, by omega⟩ : Fin n))} :
Set (Sym2 (Fin n)))
end Erdos180
end
end Arexychen
Source