Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: Family 185. Counterexamples to infinite matroid intersection and packing/covering

Family claims › Combinatorics · lines 1273–1278

OpenAI@2026-10-07#rem:oai-185

Back to manuscript

Disproves the unrestricted infinite matroid intersection and packing/covering conjectures in ZFC, using two self-dual partitional matroids on a countably infinite ground set. The same examples answer Joó’s partitional-matroid question negatively. They are neither finitary nor cofinitary, so Nash-Williams’ original finitary conjecture remains outside the result.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section