The Intersection of Two Infinite Matroids
Conjecture: Let \({\mathcal M}\) and \({\mathcal N}\) be two matroids (possibly of infinite ranks) on the same set \(S\). Then there exists a set \(I\) independent in both \({\mathcal M}\) and \({\mathcal N}\), which can be partitioned as \(I=H\cup K\), where \(\text{sp}_{\mathcal M}(H)\cup \text{sp}_{\mathcal N}(K)=S\). This conjecture is an extension of Edmonds' matroid intersection theorem to the infinite case. We prove the conjecture when one of the matroids (say \({\mathcal M})\) is the sum of countably many matroids of finite rank (the other matroid being general). For the proof we have to answer also the following question: when does there exist a subset of \(S\) which is spanning for \({\mathcal M}\) and independent in \({\mathcal N}\).
- Intersection of a partitional and a general infinite matroid
- On the intersection of infinite matroids
- On the intersection conjecture for infinite trees of matroids
- Proof of Nash-Williams' intersection conjecture for countable matroids
- Matroid intersection, base packing and base covering for infinite matroids
- Intersecting matroids by a hyperplane
- Intersecting set systems and graphic matroids
- On the intersection of infinite matroids
- On the intersection conjecture for infinite trees of matroids
- Base partition for mixed families of finitary and cofinitary matroids
- Intersection of a partitional and a general infinite matroid
- A Cantor-Bernstein theorem for infinite matroids
- Proof of Nash-Williams' intersection conjecture for countable matroids
- On partitioning two matroids into common independent subsets
- The Lovász-Cherkassky theorem in countable graphs
- Matroid intersection, base packing and base covering for infinite matroids
- Self-dual uniform matroids on infinite sets
- scientific article; zbMATH DE number 3841889 (Why is no real title available?)
- The intersection of a matroid and a simplicial complex
- On generalisations of the Aharoni–Pouzet base exchange theorem
- Finite matchability under the matroidal Hall's condition
- The edge covering number of the intersection of two matroids
- On the packing/covering conjecture of infinite matroids
- The Lovász-Cherkassky theorem in infinite graphs
- Hindrance from a wasteful partial linkage
- The almost intersection property for pairs of matroids on common groundset
- The structure of 2-separations of infinite matroids
This page was built for publication: The Intersection of Two Infinite Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354241)
