The Setting
Let and be two matroids on one ground set. Two matroids and on a common ground set pack when they have disjoint spanning sets, and cover when the ground set is the union of an independent set of and an independent set of . The packing/covering conjecture asks whether the ground set always splits into a part on which the restrictions of and pack and a part on which their contractions onto it cover.
Alongside the partition, the item fixes the ground sets built from Boolean functions of every arity: a countable set , two copies of side by side, and one copy of at each integer.
The Definition
Definition 1. The set consists of the pairs of a natural number and a Boolean function on : (1)✦ The small ground set is the disjoint union of a left copy and a right copy of : (2)✦ The ground set holds a copy of for each integer : (3)✦ For a matroid and a set , the contraction of onto is the matroid on given by (4)✦ Let and be matroids with the same ground set. A packing/covering partition of consists of disjoint sets and whose union is that ground set, disjoint sets , and sets such that (5)✦ The pair has a packing/covering partition when such sets exist.
In the paper, the result reads: , and a packing/covering partition of on their common ground set is a split of it as with disjoint spanning and independent in with .
What Is Checked
The ground sets (1), (2) and (3) are built from the integers and Boolean functions, and the contraction (4) and the partition (5) are stated over arbitrary matroids given by bases with the maximality axiom, through their duals, restrictions, spanning sets and independent sets.