Dirac's theorem on simplicial matroids
| dc.creator | Cordovil, Raul | |
| dc.creator | Lemos, Manoel | |
| dc.creator | Sales, Claudia Linhares | |
| dc.date | 2006-09-05 | |
| dc.date | 2007-10-14 | |
| dc.date.accessioned | 2026-07-07T08:35:51Z | |
| dc.date.available | 2026-07-07T08:35:51Z | |
| dc.description | We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and they are a rich new class of simplicial complexes. We show that Dirac's theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique complexes get replaced, respectively, by simplicial matroids and k-hyperclique complexes. We prove also a higher-dimensional analogue of Stanley's reformulation of Dirac's theorem on chordal graphs. | |
| dc.description | 11 pages; Annals of Combinatorics, to appear | |
| dc.identifier | https://arxiv.org/abs/math/0609119 | |
| dc.identifier | http://arxiv.org/abs/math/0609119 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139881 | |
| dc.subject | Combinatorics | |
| dc.subject | Commutative Algebra | |
| dc.subject | 05B35 (primary), 05C17 (secondary) | |
| dc.title | Dirac's theorem on simplicial matroids | |
| dc.type | text |