cyclic_four_block_good
def
Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the indexed edges whose four neighbouring edges receive four distinct colours.
Statement
def cyclic_four_block_good (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Prop
- 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
- Used by 2
- cyclic_four_block_witnessStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: witness.
- 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_good (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Prop := e.2.val = 1 ∨ e.2.val = 2 ∨ (e.2.val = 0 ∧ 0<e.1.val ∧ e.1.val+1 < (2*m+5)) ∨ (e.2.val = 3 ∧ e.1.val+2=(2*m+5))