Topological cycle matroids of infinite graphs

DOI10.1016/j.ejc.2016.09.008zbMath1348.05140arXiv1412.0830OpenAlexW1474861480MaRDI QIDQ338589

Johannes Carmesin

Publication date: 7 November 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Infinite graphs (05C63)

Related Items (3)

Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Local 2-separators ⋮ End spaces and tree-decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid intersection, base packing and base covering for infinite matroids
• Axioms for infinite matroids
• On infinite cycles. I, II
• Locally finite graphs with ends: A topological approach. II: Applications
• Duality of infinite graphs
• On spanning trees and \(k\)-connectedness in infinite graphs
• Graph-theoretical versus topological ends of graphs.
• An excluded minors method for infinite matroids
• Infinite matroids in graphs
• 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
• Infinite Hamilton cycles in squares of locally finite graphs
• Duality in Infinite Graphs
• Cycle spaces in topological spaces
• Simplicial Decompositions of Infinite Graphs

This page was built for publication: Topological cycle matroids of infinite graphs