How is a Chordal Graph like a Supersolvable Binary Matroid?
| dc.creator | Cordovil, Raul | |
| dc.creator | Forge, David | |
| dc.creator | Klein, Sulamita | |
| dc.date | 2002-12-06 | |
| dc.date | 2004-08-09 | |
| dc.date.accessioned | 2026-07-07T04:53:36Z | |
| dc.date.available | 2026-07-07T04:53:36Z | |
| dc.description | 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. | |
| dc.description | 10 pages, 3 figures, to appear in Discrete Mathematics | |
| dc.identifier | https://arxiv.org/abs/math/0212099 | |
| dc.identifier | http://arxiv.org/abs/math/0212099 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65912 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B35(primary);05CXX(secondary) | |
| dc.title | How is a Chordal Graph like a Supersolvable Binary Matroid? | |
| dc.type | text |