Matroids with a cyclic arrangement of circuits and cocircuits
Abstract
For all positive integers t exceeding one, a matroid has the cyclic (t-1,t)-property if its ground set has a cyclic ordering σ such that every set of t-1 consecutive elements in σ is contained in a t-element circuit and t-element cocircuit. We show that if M has the cyclic (t-1,t)-property and |E(M)| is sufficiently large, then these t-element circuits and t-element cocircuits are arranged in a prescribed way in σ, which, for odd t, is analogous to how 3-element circuits and cocircuits appear in wheels and whirls, and, for even t, is analogous to how 4-element circuits and cocircuits appear in swirls. Furthermore, we show that any appropriate concatenation of σ is a flower. If t is odd, then is a daisy, but if t is even, then, depending on M, it is possible for to be either an anemone or a daisy.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.