Matroid intersection, base packing and base covering for infinite matroids
type: Item
instance of: scholarly article
title: Matroid intersection, base packing and base covering for infinite matroids
zbMATH Open document ID: 1349.05051
author: Nathan Bowler
author: Johannes Carmesin
published in: Combinatorica
publication date: 2016-05-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1202.3409
review text: The authors explore infinite matroid theory. In particular, they study the relationship of the matroid intersection conjecture with the packing/covering property. They prove these conjectures are equivalent for infinite matroids. Furthermore, the authors prove a special case of the conjecture and provide an overview of the equivalencies proven.
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C63
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52B40
zbMATH DE Number: 6576811
zbMATH Keywords: matroid
zbMATH Keywords: matroid intersection conjecture
zbMATH Keywords: packing/covering property
reviewed by: Kelly J. Pearson
MaRDI profile type: Publication
OpenAlex ID: W1973904740
arXiv ID: 1202.3409
cites work: Menger's theorem for infinite graphs
cites work: Infinite, highly connected digraphs with no two arc-disjoint spanning trees
cites work: The Intersection of Two Infinite Matroids
cites work: Q3660524
cites work: Infinite matroids in graphs
cites work: Axioms for infinite matroids
cites work: Finite connectivity in infinite matroids
cites work: Q3577833
cites work: Infinite graphs—A survey
cites work: Q3135082
DOI: 10.1007/S00493-014-2953-2
description: scientific article; zbMATH DE number 6576811