2
$\begingroup$

Suppose we have a graph $G$ of order $n$. Also suppose that we form the coloring complex $S(G)$ of $G$. What does it mean when we say that $S(G)$ is shellable?

  • 0
    @JIm Conant: The definition.2011-10-26

1 Answers 1

1

See Wikipedia for the definition of a shelling of a simplicial complex.

  • 1
    No need to feel bad, Jim, you're [answering](http://math.stackexchange.com/questions/19171/why-does-substitution-in-taylor-series-work/19176#19176) the [master](http://math.stackexchange.com/questions/19292/connection-between-graphs-and-the-eigenvectors-of-their-matrix-representation/19293#19293) of [doing](http://math.stackexchange.com/questions/25710/is-so-2-an-amenable-group/25715#25715) [exactly](http://math.stackexchange.com/questions/18233/map-of-mathematical-logic/18234#18234) [that](http://math.stackexchange.com/questions/17625/proof-of-triangle-inequality-on-mathbbrn-d-p/17630#17630)!2011-10-26