k4_forest
abbrev
The 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 of opposite edges): the edge sets with at most three edges that are not a triangle.
Statement
abbrev k4_forest (I : Finset (Fin 6)) : Prop
- Defined in
- arXiv:2610.07318 (A note on the list chromatic number of two matroids), proof of Theorem 1.1 (the graphic matroid M(K₄))
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 6
- k4_forest_augThe forests of K₄ satisfy the matroid augmentation axiom.
- 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…
- k4_cycle_matroid_indepA set of edges is independent in M(K₄) exactly when it is a forest.
- k4_forest_subsetSubsets of forests of K₄ are forests.
- k4_cycle_matroidThe cycle matroid M(K₄) on the six edges of K₄.
- k4_two_forestsIf the six edges of K₄ are 2-colored so that both color classes are forests and the opposite pair {01, 23} is split, then the other two…
Lean source view module on GitHub
/-- Independent edge sets of `K₄`, edges numbered `0 = 01, 1 = 23, 2 = 02, 3 = 13, 4 = 03, 5 = 12` (so `{0,1}`, `{2,3}`, `{4,5}` are the opposite pairs): forests, i.e. at most three edges and not a triangle. -/ abbrev k4_forest (I : Finset (Fin 6)) : Prop := I.card ≤ 3 ∧ I ≠ {0, 2, 5} ∧ I ≠ {0, 3, 4} ∧ I ≠ {1, 2, 4} ∧ I ≠ {1, 3, 5}