Topological cycle matroids of infinite graphs
Johannes Carmesin

TL;DR
This paper proves that the topological cycles in any infinite graph form a matroid, expanding the understanding of infinite graph structures and their properties.
Contribution
It introduces a new class of matroids derived from topological cycles in infinite graphs, which are neither finitary nor cofinitary.
Findings
Topological cycles induce a matroid in infinite graphs
The resulting matroid is generally neither finitary nor cofinitary
Provides a new framework for analyzing infinite graph structures
Abstract
We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
