Matroid intersection, base packing and base covering for infinite matroids

DOI10.1007/s00493-014-2953-2zbMath1349.05051arXiv1202.3409OpenAlexW1973904740MaRDI QIDQ276439

Nathan Bowler, Johannes Carmesin

Publication date: 3 May 2016

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3409

zbMATH Keywords

matroidmatroid intersection conjecturepacking/covering property

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Infinite graphs (05C63)

Related Items

Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Topological cycle matroids of infinite graphs ⋮ Reconstruction of infinite matroids from their 3-connected minors ⋮ Axioms for infinite matroids ⋮ Matroid and Tutte-connectivity in infinite graphs ⋮ Proof of Nash-Williams' intersection conjecture for countable matroids ⋮ On the intersection conjecture for infinite trees of matroids ⋮ On the intersection of infinite matroids ⋮ Base partition for mixed families of finitary and cofinitary matroids ⋮ Intersection of a partitional and a general infinite matroid ⋮ The almost intersection property for pairs of matroids on common groundset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Axioms for infinite matroids
• Finite connectivity in infinite matroids
• Menger's theorem for infinite graphs
• Infinite matroids in graphs
• Infinite, highly connected digraphs with no two arc-disjoint spanning trees
• The Intersection of Two Infinite Matroids
• Infinite graphs—A survey