AFTD Auto-Formalizing Theoretical Domains

simple_graph_kayak_paddle

def

The kayak paddle graph KP(k, m, l) (k, m ≥ 3, l ≥ 1) on N = k + m + l − 1 vertices: a cycle on 0, …, k−1, a cycle on k+l−1, …, k+l+m−2, and a path 0 — k — k+1 — … — k+l−1 of length l joining vertex 0 of the first cycle to vertex k+l−1 of the second.

Statement

def simple_graph_kayak_paddle (k m l : ℕ) : SimpleGraph (Fin (k + m + l - 1))
Defined in
arXiv:2610.18463 (The group generated by a graph's derangements), Sec. 2.4 (definition of the kayak paddle graph KP(k,m,l) before Question 2.20). Vertex labelling chosen here.
Verified
15 Oct 2026
Axioms
none listed
Used by 8

Lean source view module on GitHub

/-- The kayak paddle graph `KP(k, m, l)`: cycles of lengths `k` and `m` joined by a path of length `l`. -/
def simple_graph_kayak_paddle (k m l : ℕ) : SimpleGraph (Fin (k + m + l - 1)) :=
  SimpleGraph.fromRel fun i j =>
    ((i : ℕ) < k ∧ (j : ℕ) < k ∧ (j : ℕ) = ((i : ℕ) + 1) % k) ∨
    ((i : ℕ) = 0 ∧ (j : ℕ) = k) ∨
    (k ≤ (i : ℕ) ∧ (j : ℕ) = (i : ℕ) + 1 ∧ (j : ℕ) ≤ k + l - 1) ∨
    (k + l - 1 ≤ (i : ℕ) ∧ k + l - 1 ≤ (j : ℕ) ∧
      (j : ℕ) - (k + l - 1) = ((i : ℕ) - (k + l - 1) + 1) % m)
See it in the graphDiscuss this resultChallenge it