k4_cycle_matroid
def
The cycle matroid M(K₄) on the six edges of K₄.
Statement
def k4_cycle_matroid : Matroid (Fin 6)- Defined in
- arXiv:2610.07318 (A note on the list chromatic number of two matroids), proof of Theorem 1.1
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- k4_forestThe independent sets of the cycle matroid of K₄, with the six edges numbered 01, 23, 02, 13, 03, 12 (so {0,1}, {2,3}, {4,5} are the pairs…
- k4_forest_augThe forests of K₄ satisfy the matroid augmentation axiom.
- k4_forest_subsetSubsets of forests of K₄ are forests.
- Used by 3
- matroid_common_list_colorable_two_not_of_colorable_twoThere are two loopless matroids M₁, M₂ on a common finite ground set (M₁ graphic: three disjoint copies of K₄; M₂ a unit-capacity…
- three_k4_matroidThe cycle matroid M₁ of three disjoint copies of K₄, on the ground set {0,1,2} × {edges of K₄}.
- k4_cycle_matroid_indepA set of edges is independent in M(K₄) exactly when it is a forest.
Lean source view module on GitHub
/-- The cycle matroid M(K₄) on the six edges of K₄. -/ def k4_cycle_matroid : Matroid (Fin 6) := (IndepMatroid.ofFinset Set.univ k4_forest (by decide) k4_forest_subset k4_forest_aug (fun _ _ => Set.subset_univ _)).matroid