Showing 2002Show all
2 papers · 1 filter
math.CO2002
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…
math.CO2002
Diagonal bases in Orlik-Solomon type algebras
Raul Cordovil, David Forge
To encode an important property of the "no broken circuit bases" of the Orlik-Solomon-Terao algebras, Andras Szenes has introduced a particular type of bases, the so called "diagon…