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 h-vectors 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.