The symmetric strong circuit elimination property
Christine Cho, James Oxley, and Suijie Wang

TL;DR
This paper introduces the symmetric strong circuit elimination property (SSCE) for matroids, characterizes connected matroids with this property, and develops a new axiom system based on SSCE.
Contribution
It defines SSCE, proves its equivalence to having no two skew circuits in connected matroids, and presents a new axiom system for matroids based on SSCE.
Findings
Connected matroids with SSCE have no two skew circuits.
Matroids with SSCE are characterized by forbidden series minors.
A new axiom system for matroids is proposed based on SSCE.
Abstract
If and are circuits in a matroid with in and in , then has a circuit such that . This strong circuit elimination axiom is inherently asymmetric. A matroid has the symmetric strong circuit elimination property (SSCE) if, when the above conditions hold and , there is a circuit with . We prove that a connected matroid has this property if and only if it has no two skew circuits. We also characterize such matroids in terms of forbidden series minors, and we give a new matroid axiom system that is built around a modification of SSCE.
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 · Complexity and Algorithms in Graphs · Graph Labeling and Dimension Problems
