cyclic_four_block_col
def
Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the periodic five-colouring of indexed edges, valued in Fin 5.
Statement
def cyclic_four_block_col (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Fin 5- Source
- decomposition of cyclic_four_block_graph_exists_rich_neighbor_five_coloring (proof plan of the IN-156 scratch file)
- Verified
- 25 Oct 2026
- Axioms
- none listed
- Built on 2
- cyclic_four_block_col_natHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the periodic five-colour assignment to indexed edges, as a natural…
- cyclic_four_block_col_boundStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: col bound.
- Used by 2
- cyclic_four_block_properStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: proper.
- cyclic_four_block_graph_exists_rich_neighbor_five_coloringFor every m>=0, cyclic_four_block_graph m, on 4(2m+5) vertices, admits a rich-neighbor five-edge-coloring.
Lean source view module on GitHub
def cyclic_four_block_col (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Fin 5 :=
⟨cyclic_four_block_col_nat m e,cyclic_four_block_col_bound m e⟩