Abstract
A matroid is supersolvable if it has a maximal chain of flats, each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and we show that several results for chordal graphs hold in this matroidal context. In particular, we consider matroid analogues of the reduced clique graph and clique trees for chordal graphs. The latter is a maximum-weight spanning tree of the former. We also show that the matroid analogue of a clique tree is an optimal decomposition for the matroid parameter of tree-width.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
