Loading...
Please wait, while we are loading the content...
Similar Documents
How Is a Chordal Graph Like a Supersolvable Binary Matroid? (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Forge, David Klein, Sulamita Cordovil, Raul |
| 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. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Supersolvable Binary Matroid Chordal Binary Matroids Finite Simple Graph Supersolvable Iff Modular Flat Maximal Chain Pioneering Work Cycle Matroid Chordal Graph |
| Content Type | Text |
