Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleFree Access

    Symbolic powers of cover ideals of graphs and Koszul property

    We show that attaching a whisker (or a pendant) at the vertices of a cycle cover of a graph results in a new graph with the following property: all symbolic powers of its cover ideal are Koszul or, equivalently, componentwise linear. This extends previous work where the whiskers were added to all vertices or to the vertices of a vertex cover of the graph.

  • articleNo Access

    Cohen–Macaulay graphs with large girth

    We classify Cohen–Macaulay graphs of girth at least 5 and planar Gorenstein graphs of girth at least 4. Moreover, such graphs are also vertex decomposable.

  • articleNo Access

    Expansion of a simplicial complex

    For a simplicial complex Δ, we introduce a simplicial complex attached to Δ, called the expansion of Δ, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the properties of a simplicial complex and its Stanley–Reisner ring relate to those of its expansions. It is shown that taking expansion preserves vertex decomposable and shellable properties and in some cases Cohen–Macaulayness. Also it is proved that some homological invariants of Stanley–Reisner ring of a simplicial complex relate to those invariants in the Stanley–Reisner ring of its expansions.

  • articleNo Access

    A Construction of Sequentially Cohen–Macaulay Graphs

    For every simple graph G, a class of multiple clique cluster-whiskered graphs Geπm is introduced, and it is shown that all such graphs are vertex decomposable; thus, the independence simplicial complex IndGeπm is sequentially Cohen–Macaulay. The properties of the graphs Geπm and Gπ constructed by Cook and Nagel are studied, including the enumeration of facets of the complex IndGπ and the calculation of Betti numbers of the cover ideal Ic(Geπm). We also prove that the complexΔ=IndH is strongly shellable and pure for either a Boolean graph H=Bn or the full clique-whiskered graph H=GW of G, which is obtained by adding a whisker to each vertex of G. This implies that both the facet ideal I(Δ) and the cover ideal Ic(H) have linear quotients.