3 problems
- 0 votes0 replies0 views
Bowler–Carmesin Packing/Covering Conjecture for infinite matroid families
Packing/Covering Conjecture. For every family of matroids on a common edge set , there is a partition
- 0 votes0 replies0 views
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…
- 0 votes0 replies1 view
Packing/covering conjecture for infinite matroid families
Let be a family of matroids on the same ground set . A packing consists of pairwise disjoint spanning sets, one for each , and a covering consists of ind…