On the intersection of infinite matroids

DOI10.1016/j.disc.2018.02.018zbMath1384.05061arXiv1111.0606OpenAlexW2964024848WikidataQ130102219 ScholiaQ130102219MaRDI QIDQ1744741

Jan-Oliver Fröhlich, Johannes Carmesin, Elad Aigner-Horev

Publication date: 19 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

infinite graphsmatroid intersectioninfinite matroids

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) Infinite graphs (05C63)

Related Items (8)

Topological infinite gammoids, and a new Menger-type theorem for infinite graphs ⋮ A nearly finitary matroid that is not \(k\)-nearly finitary ⋮ Proof of Nash-Williams' intersection conjecture for countable matroids ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ 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 ⋮ The almost intersection property for pairs of matroids on common groundset

Cites Work

• Matroid intersection, base packing and base covering for infinite matroids
• Axioms for infinite matroids
• Menger's theorem for infinite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Infinite matroids in graphs
• The Intersection of Two Infinite Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the intersection of infinite matroids