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
- kayak_paddle_three_three_one_leap_group_eq_topThe kayak paddle graph KP(3, 3, 1) (two triangles joined by an edge, 6 vertices) has full leap group S_6.
- kayak_paddle_leap_group_ne_of_even_cycleIf one of the two cycles of the kayak paddle graph KP(k, m, l) has even length, its leap group is neither the symmetric nor the…
- kayak_paddle_hop_maps_second_cycleIn KP(k, m, l) with m even, every hop maps the vertex set of the second cycle (the m-cycle) into itself.
- kayak_paddle_hop_maps_first_cycleIn KP(k, m, l) with k even, every hop maps the vertex set of the first cycle (the k-cycle) into itself.
- kayak_paddle_leap_group_ne_of_even_secondIf the second cycle of KP(k, m, l) has even length m, its leap group is neither the symmetric nor the alternating group.
- kayak_paddle_leap_group_ne_of_even_firstIf the first cycle of KP(k, m, l) has even length k, its leap group is neither the symmetric nor the alternating group.
- simple_graph_kayak_paddle_adj_zero_kIn KP(k, m, l), vertex 0 of the first cycle is adjacent to vertex k, the first vertex after it on the connecting path.
- kayak_paddle_leap_group_not_eq_top_or_alternatingNo: KP(3, 4, 1) (a triangle and a 4-cycle joined by an edge, 7 vertices) admits a hop, but its leap group is neither S_7 nor A_7. Every…
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)