Axioms for infinite matroids

  title={Axioms for infinite matroids},
  author={Henning Bruhn and Reinhard Diestel and Matthias Kriesell and Rudi Pendavingh and Paul Wollan},
  journal={Advances in Mathematics},

Figures from this paper

Thin sums matroids and duality
Relative rank axioms for infinite matroids
In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of
Infinite trees of matroids
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.
Finite connectivity in infinite matroids
Factorization theorems for strong maps between matroids of arbitrary cardinality
Abstract In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps
Topological cycle matroids of infinite graphs
The structure of 2-separations of infinite matroids
On Infinite Matroids with Strong Maps: Proto-exactness and Finiteness Conditions
This paper investigates infinite matroids from a categorical perspective. We prove that the category of infinite matroids is a proto-exact category in the sense of Dyckerhoff and Kapranov, thereby
The Almost Intersection Property for Pairs of Matroids on Common Groundset
It is proved that if a pair satisfies the Almost Intersection Property then it satisfies the Matroid Intersection Conjecture of Nash-Williams and some corollaries of that result are presented.


Finite connectivity in infinite matroids
Duality theory for finite and infinite matroids with coefficients
Decomposition of regular matroids
Strong Duality Property for Matroids with Coefficients
This paper characterize those Klee matroids arising as closure operators of matroid with coefficients that have the strong duality property and studies the subclass corresponding to the case in which both dualities coincide.
Submodular Functions, Matroids, and Certain Polyhedra
  • J. Edmonds
  • Mathematics
    Combinatorial Optimization
  • 2001
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the
Infinite matroids in graphs
Recent work in matroid representation theory
Equicardinality of bases in $B$-matroids
It is very well known that any two bases of a finitary matroid (see [2] for definitions) have the same cardinality. As Dlab has shown in [1], the same does not hold for arbitrary transitive exchange
Infinite matroid union
We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the