How is a Chordal Graph like a Supersolvable Binary Matroid?

Raul Cordovil, David Forge, Sulamita Klein

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…