Packing conjecture for infinite matroid families
Packing conjecture for infinite matroid families
Let be a family of matroids on the same ground set . A covering for is a family of independent sets whose union covers , and a packing is a family of pairwise disjoint spanning sets. Packing conjecture. The family has a packing if and only if, for every , whenever has a covering, it also has a packing. This condition is designed as an infinite analogue of the finite base packing theorem and is stated to characterize when a packing exists.
Sources & referencesView supporting material
Primary source
Nathan Bowler and Johannes Carmesin, “Matroid intersection, base packing and base covering for infinite matroids”, arXiv:1202.3409 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.