2604.01179 The Antichain Width Conjecture: Complete Resolution for Posets of Width at Most 6 via SAT Solver Verification
We present a complete computer-assisted verification of the Antichain Width Conjecture for all finite partially ordered sets (posets) of width at most 6. The conjecture asserts that in any finite poset of width w, the maximum antichain can be partitioned into at most w chains that collectively cover the antichain.