Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Details Shellable graphs and sequentially Cohen-Macaulay bipartite graphs Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

2007-01-10

arxiv.org/abs/math/0701296v2

Mathematics

Combinatorics

16 pages; more detail added to some proofs; Corollary 2.10 was been clarified; the beginning of Section 4 has been rewritten;

Scientific paper

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of Bjorner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give an recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.

Affiliated with

Also associated with

No associations

Rating

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Shellable graphs and sequentially Cohen-Macaulay bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shellable graphs and sequentially Cohen-Macaulay bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-642920