arXiv (OAI Expanded)
open access
Matroids with cycle systems are regular
A cycle system for a matroid $M$ is a collection of cycles (unions of circuits) whose intersection properties mimic the cut sets of a graph. Cycle systems were introduced by Corry, the first author, McClain, Perkinson, and Yi, who showed that the $h$-vector of any matroid that admits a cycle system
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Relaxed coparking functions and Stanley's conjecture for matroid $h$-vectors#1160743
- Existence and Characterisation of Bivariate Bicycle Codes#183208
- Integrality-Gap Bounds for Weighted Matchoids and Matroid Intersection#1035877
- Classes of binary matroids with small lists of excluded induced minors#1142529
- Simple Network Management Protocol#134823
Record · ID 1071157
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive