The Chip Firing Game and Matroid Complexes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2001

The Chip Firing Game and Matroid Complexes

Résumé

In this paper we construct from a cographic matroid M, a pure multicomplex whose degree sequence is the h―vector of the the matroid complex of M. This result provesa conjecture of Richard Stanley [Sta96] in the particular case of cographic matroids. We also prove that the multicomplexes constructed are M―shellable, so proving a conjecture of Manoj Chari [Cha97] again in the case of cographic matroids. The proofs use results on a game for graphs called the chip firing game.
Fichier principal
Vignette du fichier
dmAA0118.pdf (110.27 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01182958 , version 1 (11-08-2015)

Identifiants

Citer

Criel Merino. The Chip Firing Game and Matroid Complexes. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.245-256, ⟨10.46298/dmtcs.2278⟩. ⟨hal-01182958⟩

Collections

TDS-MACS
158 Consultations
746 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More