Intersection of a partitional and a general infinite matroid
From MaRDI portal
Publication:2037592
Abstract: Let be a possibly infinite set and let and be matroids defined on . We say that the pair has the Intersection property if and share an independent set admitting a bipartition such that . The Matroid Intersection Conjecture of Nash-Williams says that every matroid pair has the Intersection property. The conjecture is known and easy to prove in the case when one of the matroids is uniform and it was shown by Bowler and Carmesin that the conjecture is implied by its special case where one of the matroids is a direct sum of uniform matroids, i.e., is a partitional matroid. We show that if is an arbitrary matroid and is the direct sum of finitely many uniform matroids, then has the Intersection property.
Recommendations
- On the intersection of infinite matroids
- The Intersection of Two Infinite Matroids
- scientific article; zbMATH DE number 3979077
- On the intersection conjecture for infinite trees of matroids
- Matroids with an infinite circuit-cocircuit intersection
- Matroid intersection, base packing and base covering for infinite matroids
- The intersection of matroids and antimatroids
- A construction of infinite sets of intertwines for pairs of matroids
- On matroid intersection adjacency
- Matroid representations by partitions
Cites work
- scientific article; zbMATH DE number 67321 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- Abstract linear dependence
- Axioms for infinite matroids
- Base partition for mixed families of finitary and cofinitary matroids
- Equicardinality of Bases in B-Matroids
- Infinite Matroids
- Matroid intersection, base packing and base covering for infinite matroids
- Matroids and duality
- On the intersection of infinite matroids
- Proof of Nash-Williams' intersection conjecture for countable matroids
- Self-dual uniform matroids on infinite sets
- The Intersection of Two Infinite Matroids
- The almost intersection property for pairs of matroids on common groundset
Cited in
(9)- Matroid intersection, base packing and base covering for infinite matroids
- On the intersection conjecture for infinite trees of matroids
- Fair representation in the intersection of two matroids
- The almost intersection property for pairs of matroids on common groundset
- On the intersection of infinite matroids
- On the packing/covering conjecture of infinite matroids
- The structure of 2-separations of infinite matroids
- scientific article; zbMATH DE number 3979077 (Why is no real title available?)
- Proof of Nash-Williams' intersection conjecture for countable matroids
This page was built for publication: Intersection of a partitional and a general infinite matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037592)