Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

As the title suggests, I was wondering if anyone can point me to any examples in the literature to flag complexes that are shellable but not vertex decomposable.

It is well-known that if a simplicial complex $\Delta$ is vertex decomposable, then $\Delta$ is also shellable. There are examples where the converse fails, but in all the examples I have seen, $\Delta$ is not a flag complex, i.e., its maximal non-faces all have cardinality two. (A flag complex is sometimes called an independence complex of a graph, since the faces of the complex correspond to the independent sets of the graph).

Some context: I've been looking at the independence complexes of circulant graphs, and as part of this project, my co-authors and I discovered that the independence complex of $C_{16}(1,4,8)$ is shellable but not vertex decomposable. (This is the graph with the vertex set $\{0,1,...,15\}$ where there is an edge between $i$ and $j$ if and only if $|i-j|$ or $16-|i-j|$ is in $\{1,4,8\}$.) We are not aware of any other examples of flag complexes with this property. Even if such examples do exist, we were curious how the size of our example compared with the known examples.

share|improve this question
    
The term "clique complex" is also used in the literature, see en.wikipedia.org/wiki/Clique_complex. –  Christian Stump 1 hour ago

1 Answer 1

Not an answer; just a "public service," because I wanted to see Adam's example explicitly.

Here is $C_{16}(1,4,8)$ [if I computed this correctly]. So $1$ is connected to $(13,9,5,2)$ because $$16-|1{-}13|=4$$ $$16-|1{-}9|=8$$ $$|1{-}9|=8$$ $$|1{-}5|=4$$ $$|1{-}2|=1$$ Etc.:


 


share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.