{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:01Z","timestamp":1753893841822,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the symmetric difference of every pair of intersecting circuits is a single circuit. Our main result shows that a connected regular matroid is circuit-difference if and only if it contains no pair of skew circuits. Using a result of Pfeil, this enables us to explicitly determine all regular circuit-difference matroids. The class of circuit-difference matroids is not closed under minors, but it is closed under series minors. We characterize the infinitely many excluded series minors for the class.<\/jats:p>","DOI":"10.37236\/9314","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T12:55:27Z","timestamp":1595940927000},"source":"Crossref","is-referenced-by-count":0,"title":["Circuit-Difference Matroids"],"prefix":"10.37236","volume":"27","author":[{"given":"George","family":"Drummond","sequence":"first","affiliation":[]},{"given":"Tara","family":"Fife","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Grace","sequence":"additional","affiliation":[]},{"given":"James","family":"Oxley","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2020,7,24]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p11\/8128","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p11\/8128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T12:55:36Z","timestamp":1595940936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i3p11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,24]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,7,9]]}},"URL":"https:\/\/doi.org\/10.37236\/9314","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,7,24]]},"article-number":"P3.11"}}