Ordering circuits of matroids

DOI10.37236/11117MaRDI QIDQ2112564zbMATH OpenOpenAlexFDO

Authors Cameron Crenshaw, James Oxley

Publication date 11 January 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2203.08305

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

circuitmatroidorderable

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A characterization of graphic matroids based on circuit orderings
• Internally 4-connected binary matroids with cyclically sequential orderings
• A circuit characterization of graphic matroids
• Adjacency, inseparability, and base orderability in matroids
• Ordering of the elements of a matroid such that its consecutive w elements are independent

Cites work

• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• 2-Isomorphic Graphs
• A circuit characterization of graphic matroids
• A strengthened form of Tutte's characterization of regular matroids
• Adjacency in binary matroids
• Kuratowski's and Wagner's theorems for matroids
• Matroids and Graphs
• Minors of 3-connected matroids
• On Nonbinary 3-Connected Matroids

Cited in

(4)

• A characterization of graphic matroids based on circuit orderings
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Ordered matroids and regular independence systems
• Ordering Circuits of Matroids

This page was built for publication: Ordering circuits of matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2112564)