How is a chordal graph like a supersolvable binary matroid?

DOI10.1016/J.DISC.2004.08.004MaRDI QIDQ704292zbMATH OpenOpenAlexFDO

Authors Raul Cordovil, David Forge, Sulamita Klein

Publication date 13 January 2005

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Chordal graphsBinary matroidsCliquesSupersolvable matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to read Dirac's theorem on chordal graphs. Chordal binary matroids are not in general supersolvable. Nevertheless we prove that, for every supersolvable binary matroid M, a maximal chain of modular flats of M canonically determines a chordal graph.

Recommendations

• Publication:4723757
• Chordal characterization of graphic matroids
• Binary Supersolvable Matroids and Modular Constructions
• Matroid union -- graphic? binary? neither?
• scientific article; zbMATH DE number 1076150
• scientific article; zbMATH DE number 653261
• On the chordality of a graph
• Isomorphism between arrangements and matroids and some properties of super-solvability
• Chords and disjoint paths in matroids
• A class of hypergraphs that generalizes chordal graphs

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3422398 (Why is no real title available?)
• Binary Supersolvable Matroids and Modular Constructions
• Modular Constructions for Combinatorial Geometries
• On rigid circuit graphs
• On the cycle polytope of a binary matroid
• Supersolvable lattices
• T-uniqueness of some families of \(k\)-chordal matroids
• Theory of Matroids

Cited in

(6)

• Chordal matroids arising from generalized parallel connections
• Supersolvable saturated matroids and chordal graphs
• Dirac's theorem on simplicial matroids
• Binary Supersolvable Matroids and Modular Constructions
• A characterization of signed graphs with generalized perfect elimination orderings
• Chordal matroids arising from generalized parallel connections. II

This page was built for publication: How is a chordal graph like a supersolvable binary matroid?

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