Cyclic matroids
Nick Brettell, Charles Semple, Gerry Toft

TL;DR
This paper characterizes nearly cyclic matroids with large ground sets, showing they are actually cyclic and can be derived from specific well-understood matroids through truncation and weak-map operations.
Contribution
It establishes the structure of nearly $(s,t)$-cyclic matroids for large $n$, proving they are $(s,t)$-cyclic and related to truncated whirl and swirl matroids.
Findings
Nearly $(s,t)$-cyclic implies $(s,t)$-cyclic for large $n$
$(s,t)$-cyclic matroids are weak-map images of truncated well-known matroids
Special cases include whirl and swirl matroids for $s=3$ and $s=4$
Abstract
For all positive integers and exceeding one, a matroid on elements is {\em nearly -cyclic} if there is a cyclic ordering of its ground set such that every consecutive elements of are contained in an -element circuit and every consecutive elements of are contained in a -element cocircuit. In the case , nearly -cyclic matroids have been studied previously. In this paper, we show that if is nearly -cyclic and is sufficiently large, then these -element circuits and -element cocircuits are consecutive in in a prescribed way, that is, is "-cyclic". Furthermore, we show that, given and where , every -cyclic matroid on elements is a weak-map image of the -th truncation of a certain -cyclic matroid. If…
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph Labeling and Dimension Problems
