Cohen-macaulay graphs and face vectors of flag complexes

David Cook, Uwe Nagel

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

Abstract

We introduce a construction on a flag complex that by means of modifying the associated graph generates a new flag complex whose h-vector is the face vector of the original complex. This construction yields a vertex-decomposable, hence Cohen-Macaulay, complex. From this we get a (nonnumerical) characterization of the face vectors of flag complexes and deduce also that the face vector of a flag complex is the h-vector of some vertex-decomposable flag complex. We conjecture that the converse of the latter is true and prove this, by means of an explicit construction, for hvectors of Cohen-Macaulay flag complexes arising from bipartite graphs. We also give several new characterizations of bipartite graphs with Cohen-Macaulay or Buchsbaum independence complexes.

Original languageEnglish
Pages (from-to)89-101
Number of pages13
JournalSIAM Journal on Discrete Mathematics
Volume26
Issue number1
DOIs
StatePublished - 2012

Keywords

  • Cohen-Macaulay
  • Face vector
  • H-vector
  • Independence complex
  • Stanley-Reisner ideal
  • Vertex-decomposable

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Cohen-macaulay graphs and face vectors of flag complexes'. Together they form a unique fingerprint.

Cite this