/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Alspach's conjecture on cycle decompositions of complete graphs (1981; proved 2014)

References:

    Wikipedia

    [Al81] Alspach, B. (1981). "Research problems, Problem 3." Discrete Math. 36, p. 333.

    [BHP14] Bryant, D., Horsley, D. and Pettersson, W. (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths." Proc. London Math. Soc. 108, pp. 1153--1192. arXiv:1204.3709

    [GJKKO21] Glock, S., Joos, F., Kim, J., Kühn, D. and Osthus, D. (2021). "Resolution of the Oberwolfach problem." J. Eur. Math. Soc. 23, pp. 2511--2547. arXiv:1806.04644

@[expose] public sectionopen SimpleGraph Finsetnamespace AlspachConjecturevariable {V : Type*} [Fintype V] [DecidableEq V]open Classical in

A multiset of cycles C is a cycle decomposition of G if every edge of G lies on exactly one of the cycles.

def IsCycleDecomposition (G : SimpleGraph V) [DecidableRel G.Adj] (C : Multiset (Cycle G)) : Prop := ∀ e ∈ G.edgeFinset, (C.filter fun c => e ∈ c.edges).card = 1

The multiset of cycle lengths of a family of cycles.

def lengths {G : SimpleGraph V} (C : Multiset (Cycle G)) : Multiset ℕ := C.map SimpleGraph.Cycle.length

Alspach's conjecture (1981), proved by Bryant, Horsley and Pettersson (2014).

Let $n$ be odd and let $m_1, \dots, m_t$ be integers with $3 \le m_i \le n$ and $m_1 + \dots + m_t = \binom{n}{2}$. Then the complete graph $K_n$ decomposes into cycles of lengths $m_1, \dots, m_t$. (These conditions are clearly necessary: $K_n$ has all degrees even only for odd $n$, and its edges must be split exactly among the cycles.)

@[category research solved, AMS 5] theorem alspach_conjecture : ∀ (n : ℕ), Odd n → ∀ m : Multiset ℕ, (∀ x ∈ m, 3 ≤ x ∧ x ≤ n) → m.sum = n.choose 2 → ∃ C : Multiset (Cycle (completeGraph (Fin n))), IsCycleDecomposition (completeGraph (Fin n)) C ∧ lengths C = m := ⊢ ∀ (n : ℕ), Odd n → ∀ (m : Multiset ℕ), (∀ x ∈ m, 3 ≤ x ∧ x ≤ n) → m.sum = n.choose 2 → ∃ C, IsCycleDecomposition (completeGraph (Fin n)) C ∧ lengths C = m All goals completed! 🐙open Classical in

The even case (Bryant–Horsley–Pettersson 2014).

For even $n$, the complete graph minus a perfect matching, $K_n - I$, decomposes into cycles of lengths $m_1, \dots, m_t$ whenever $3 \le m_i \le n$ and $\sum m_i = \binom{n}{2} - n/2$. Since Mathlib has no canonical perfect matching of $K_n$, we state this for any perfect matching I.

Reference: [BHP14].

@[category research solved, AMS 5] theorem alspach_conjecture.variants.even (n : ℕ) (hn : Even n) (I : (completeGraph (Fin n)).Subgraph) (hI : I.IsPerfectMatching) (m : Multiset ℕ) (hm : ∀ x ∈ m, 3 ≤ x ∧ x ≤ n) (hsum : m.sum = n.choose 2 - n / 2) : ∃ C : Multiset (Cycle (completeGraph (Fin n) \ I.spanningCoe)), IsCycleDecomposition (completeGraph (Fin n) \ I.spanningCoe) C ∧ lengths C = m := n:ℕhn:Even nI:(completeGraph (Fin n)).SubgraphhI:I.IsPerfectMatchingm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ nhsum:m.sum = n.choose 2 - n / 2⊢ ∃ C, IsCycleDecomposition (completeGraph (Fin n) \ I.spanningCoe) C ∧ lengths C = m All goals completed! 🐙

A long-cycle corollary of the Alspach theorem (Bryant–Horsley–Pettersson 2014).

For odd $n$, the conjecture holds whenever all the prescribed lengths $m_i$ are at least $\lceil(n+4)/2\rceil$. This follows from [BHP14, Theorem 1].

@[category research solved, AMS 5] theorem alspach_conjecture.variants.long_cycles (n : ℕ) (hn : Odd n) (m : Multiset ℕ) (hm : ∀ x ∈ m, (n + 5) / 2 ≤ x ∧ x ≤ n) (hsum : m.sum = n.choose 2) : ∃ C : Multiset (Cycle (completeGraph (Fin n))), IsCycleDecomposition (completeGraph (Fin n)) C ∧ lengths C = m := n:ℕhn:Odd nm:Multiset ℕhm:∀ x ∈ m, (n + 5) / 2 ≤ x ∧ x ≤ nhsum:m.sum = n.choose 2⊢ ∃ C, IsCycleDecomposition (completeGraph (Fin n)) C ∧ lengths C = m All goals completed! 🐙

The empty family decomposes an edgeless graph.

@[category API, AMS 5] lemma isCycleDecomposition_zero {G : SimpleGraph V} [DecidableRel G.Adj] (h : G.edgeFinset = ∅) : IsCycleDecomposition G 0 := fun e he => V:Type u_1inst✝²:Fintype Vinst✝¹:DecidableEq VG:SimpleGraph Vinst✝:DecidableRel G.Adjh:G.edgeFinset = ∅e:Sym2 Vhe:e ∈ G.edgeFinset⊢ (Multiset.filter (fun c ↦ e ∈ c.edges) 0).card = 1 All goals completed! 🐙

The case $n = 1$.

$K_1$ has no edges, so the only admissible multiset of lengths is empty and the empty decomposition works.

m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 1hsum:m.sum = Nat.choose 1 2hm0:m = 0⊢ ∃ C, IsCycleDecomposition (completeGraph (Fin 1)) C ∧ lengths C = m hm:∀ x ∈ 0, 3 ≤ x ∧ x ≤ 1hsum:Multiset.sum 0 = Nat.choose 1 2⊢ ∃ C, IsCycleDecomposition (completeGraph (Fin 1)) C ∧ lengths C = 0 hm:∀ x ∈ 0, 3 ≤ x ∧ x ≤ 1hsum:Multiset.sum 0 = Nat.choose 1 2⊢ (completeGraph (Fin 1)).edgeFinset = ∅ All goals completed! 🐙

The triangle 0 → 1 → 2 → 0 as a cycle of K₃.

V:Type u_1inst✝¹:Fintype Vinst✝:DecidableEq V⊢ (Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil))).edges.Nodup ∧ Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil)) ≠ Walk.nil ∧ (Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil))).support.tail.Nodup exact ⟨V:Type u_1inst✝¹:Fintype Vinst✝:DecidableEq V⊢ (Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil))).edges.Nodup All goals completed! 🐙, V:Type u_1inst✝¹:Fintype Vinst✝:DecidableEq V⊢ Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil)) ≠ Walk.nil All goals completed! 🐙, V:Type u_1inst✝¹:Fintype Vinst✝:DecidableEq V⊢ (Walk.cons ⋯ (Walk.cons ⋯ (Walk.cons ⋯ Walk.nil))).support.tail.Nodup All goals completed! 🐙⟩

The case $n = 3$.

$K_3$ has three edges, so the only admissible multiset of lengths is ${3}$, realised by the triangle itself.

m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1a:Fin 3b:Fin 3he:s(a, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s(a, b) ∉ triangle.edgeshe':a ≠ b⊢ s(a, b) ∈ triangle.edges m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨0, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨0, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨0, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨0, ⋯⟩, b) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨1, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨1, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨1, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨1, ⋯⟩, b) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨2, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨2, ⋯⟩, b) ∈ triangle.edges m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨0, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨0, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨0, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨0, ⋯⟩, b) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨1, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨1, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨1, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨1, ⋯⟩, b) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1b:Fin 3he:s((fun i ↦ i) ⟨2, ⋯⟩, b) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, b) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ b⊢ s((fun i ↦ i) ⟨2, ⋯⟩, b) ∈ triangle.edges m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨0, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨1, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨2, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ triangle.edges m:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨0, ⋯⟩ ≠ (fun i ↦ i) ⟨0, ⋯⟩⊢ s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨0, ⋯⟩ ≠ (fun i ↦ i) ⟨1, ⋯⟩⊢ s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨0, ⋯⟩ ≠ (fun i ↦ i) ⟨2, ⋯⟩⊢ s((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨1, ⋯⟩ ≠ (fun i ↦ i) ⟨0, ⋯⟩⊢ s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨1, ⋯⟩ ≠ (fun i ↦ i) ⟨1, ⋯⟩⊢ s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨1, ⋯⟩ ≠ (fun i ↦ i) ⟨2, ⋯⟩⊢ s((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨0, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨1, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) ∈ triangle.edgesm:Multiset ℕhm:∀ x ∈ m, 3 ≤ x ∧ x ≤ 3hsum:m.sum = Nat.choose 3 2hm3:m = Multiset.replicate m.card 3hcard:m.card = 1he:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ (completeGraph (Fin 3)).edgeFinseth:s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∉ triangle.edgeshe':(fun i ↦ i) ⟨2, ⋯⟩ ≠ (fun i ↦ i) ⟨2, ⋯⟩⊢ s((fun i ↦ i) ⟨2, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) ∈ triangle.edges first | All goals completed! 🐙 | All goals completed! 🐙

The exceptional Oberwolfach $2$-factor C₄ + C₅ on nine vertices.

def oberwolfachException9 : SimpleGraph (Fin 4 ⊕ Fin 5) := cycleGraph 4 ⊕g cycleGraph 5

The exceptional Oberwolfach $2$-factor C₃ + C₃ + C₅ on eleven vertices.

def oberwolfachException11 : SimpleGraph ((Fin 3 ⊕ Fin 3) ⊕ Fin 5) := (cycleGraph 3 ⊕g cycleGraph 3) ⊕g cycleGraph 5

The Oberwolfach problem (Ringel 1967).

For odd $n$ and a $2$-regular graph $F$ on $n$ vertices, can $K_n$ be decomposed into $(n-1)/2$ spanning subgraphs isomorphic to $F$? The decomposition is known to be impossible for exactly two pairs with odd $n$ — $(9, C_4 + C_5)$ and $(11, C_3 + C_3 + C_5)$ — and is conjectured to exist in every other case. Known for all sufficiently large $n$ [GJKKO21].

@[category research open, AMS 5] theorem alspach_conjecture.variants.oberwolfach : ∀ (n : ℕ), Odd n → 3 ≤ n → ∀ (F : SimpleGraph (Fin n)) [DecidableRel F.Adj], (∀ v, F.degree v = 2) → IsEmpty (F ≃g oberwolfachException9) → IsEmpty (F ≃g oberwolfachException11) → ∃ D : Fin ((n - 1) / 2) → SimpleGraph (Fin n), (∀ i, Nonempty (D i ≃g F)) ∧ ∀ u v, (completeGraph (Fin n)).Adj u v ↔ ∃! i, (D i).Adj u v := ⊢ ∀ (n : ℕ), Odd n → 3 ≤ n → ∀ (F : SimpleGraph (Fin n)) [inst : DecidableRel F.Adj], (∀ (v : Fin n), F.degree v = 2) → IsEmpty (F ≃g oberwolfachException9) → IsEmpty (F ≃g oberwolfachException11) → ∃ D, (∀ (i : Fin ((n - 1) / 2)), Nonempty (D i ≃g F)) ∧ ∀ (u v : Fin n), (completeGraph (Fin n)).Adj u v ↔ ∃! i, (D i).Adj u v All goals completed! 🐙end AlspachConjecture