Infinite graphic matroids

DOI10.1007/S00493-016-3178-3zbMATH Open1413.05042arXiv1309.3735OpenAlexW2744085194WikidataQ130111006 ScholiaQ130111006MaRDI QIDQ722341FDOQ722341

Robin Christian, Johannes Carmesin, Nathan Bowler

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

Abstract: An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and only if it can be represented by a graph-like topological space: that is, a graph-like space in the sense of Thomassen and Vella. This extends Tutte's characterization of finite graphic matroids. The representation we construct has many pleasant topological properties. Working in the representing space, we prove that any circuit in a 3-connected graphic matroid is countable.

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

Recommendations

• Infinite matroids in graphs
• On excluded minors for classes of graphical matroids
• An excluded minors method for infinite matroids
• scientific article; zbMATH DE number 1028231
• Matroid and Tutte-connectivity in infinite graphs

zbMATH Keywords

graphic 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) Graph minors (05C83)

Cites Work

• Axioms for infinite matroids
• Infinite matroids in graphs
• Finite connectivity in infinite matroids
• Matroids with an infinite circuit-cocircuit intersection
• Thin sums matroids and duality
• An excluded minors method for infinite matroids
• The planarity theorems of MacLane and Whitney for graph-like continua
• Graph-like continua, augmenting arcs, and Menger's theorem
• Arboricity and tree-packing in locally finite graphs
• Cycle spaces in topological spaces
• Locally finite graphs with ends: A topological approach. II: Applications
• MacLane's planarity criterion for locally finite graphs
• Duality of Ends
• Reconstruction of infinite matroids from their 3-connected minors

Cited In (11)

• Axioms for infinite matroids
• \(n\)-arc and \(n\)-circle connected graph-like spaces
• Peripheral circuits in infinite binary matroids
• Infinite graphical Frobenius representations
• Thin sums matroids and duality
• Base partition for mixed families of finitary and cofinitary matroids
• Matchable infinite graphs
• Topological cycle matroids of infinite graphs
• Eulerian Spaces
• On the intersection conjecture for infinite trees of matroids
• Representations of infinite tree sets

This page was built for publication: Infinite graphic matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722341)