Peripheral circuits in infinite binary matroids
From MaRDI portal
Publication:1633758
DOI10.1016/j.jctb.2018.07.001zbMath1402.05028OpenAlexW2825514135WikidataQ129552208 ScholiaQ129552208MaRDI QIDQ1633758
Robin Christian, Nathan Bowler, R. Bruce Richter
Publication date: 20 December 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2018.07.001
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Axioms for infinite matroids
- Finite connectivity in infinite matroids
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
- Infinite graphic matroids
- Graph-like continua, augmenting arcs, and Menger's theorem
- Reconstruction of infinite matroids from their 3-connected minors
- Cycle spaces in topological spaces
- Lectures on matroids
- Matroids and duality
- How to Draw a Graph
- Infinite Matroids
This page was built for publication: Peripheral circuits in infinite binary matroids