Mathematics – Combinatorics
Scientific paper
2002-12-06
Mathematics
Combinatorics
10 pages, 3 figures, to appear in Discrete Mathematics
Scientific paper
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.
Cordovil Raul
Forge David
Klein Sulamita
No associations
LandOfFree
How is a Chordal Graph like a Supersolvable Binary Matroid? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How is a Chordal Graph like a Supersolvable Binary Matroid?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How is a Chordal Graph like a Supersolvable Binary Matroid? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-86819