Infinite matroids in graphs

Details Infinite matroids in graphs Infinite matroids in graphs

2010-11-22

arxiv.org/abs/1011.4749v2

Mathematics

Combinatorics

Scientific paper

It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of infinite graphs. We also describe their algebraic cycle matroids, those whose circuits are the finite cycles and double rays, and determine their duals. Finally, we give a sufficient condition for a matroid to be representable in a sense adapted to infinite matroids. Which graphic matroids are representable in this sense remains an open question.

Affiliated with

Also associated with

No associations

Rating

Infinite matroids in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite matroids in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite matroids in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657121