AFTD Auto-Formalizing Theoretical Domains

three_k4_partition_matroid

def

The unit-capacity partition matroid M₂ whose independent sets meet every class of three_k4_partition_class at most once.

Statement

def three_k4_partition_matroid : Matroid (Fin 3 × Fin 6)
Defined in
arXiv:2610.07318 (A note on the list chromatic number of two matroids), proof of Theorem 1.1 (M₂)
Verified
07 Oct 2026
Axioms
none listed
Built on 1
  • three_k4_partition_classThe nine classes of the partition matroid M₂: in copy i the opposite pair a_i (edges 01, 23) is a class, and the classes {b_i⁺, c_{i+1}⁻}…
Used by 2

Lean source view module on GitHub

/-- The unit-capacity partition matroid M₂ whose independent sets meet every class of three_k4_partition_class at most once. -/
def three_k4_partition_matroid : Matroid (Fin 3 × Fin 6) :=
  (Matroid.freeOn (Set.univ : Set (Fin 9))).comap three_k4_partition_class
See it in the graphDiscuss this resultChallenge it