How is a chordal graph like a supersolvable binary matroid?
From MaRDI portal
Publication:704292
DOI10.1016/J.DISC.2004.08.004zbMATH Open1057.05021arXivmath/0212099OpenAlexW2151201250MaRDI QIDQ704292FDOQ704292
Sulamita Klein, David Forge, Raul Cordovil
Publication date: 13 January 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0212099
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- On rigid circuit graphs
- Supersolvable lattices
- Theory of Matroids
- Modular Constructions for Combinatorial Geometries
- On the cycle polytope of a binary matroid
- Title not available (Why is that?)
- T-uniqueness of some families of \(k\)-chordal matroids
- Binary Supersolvable Matroids and Modular Constructions
Cited In (5)
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)
