加载中…
We report on an exhaustive census of all 1,006,700,565 connected graphs on vertices to find the minimal examples of graphs whose independence complexes are Cohen-Macaulay but not shellable, or shellable but not vertex decomposable. In particular, there are exactly two graphs where is Cohen-Macaulay but not shellable, when the characteristic is not two, and exactly six graphs where is shellable but not vertex decomposable.

生成讲解博客的中文版本

生成AI智能校验的中文版本