Boolean graphs are Cohen–Macaulay

DOI10.1080/00927872.2018.1448839zbMath1404.13029arXiv1611.07574OpenAlexW3101986180MaRDI QIDQ5376013

Aming Liu, Tong Suo Wu

Publication date: 17 September 2018

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07574

zbMATH Keywords

vertex decomposable graphsCohen-Macaulay graphsBoolean graphsunmixed graphs

Mathematics Subject Classification ID

Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Combinatorial aspects of simplicial complexes (05E45) Combinatorial aspects of commutative algebra (05E40)

Related Items (3)

A large class of graphs with a small subclass of Cohen–Macaulay members ⋮ A new view toward vertex decomposable graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On the Stanley-Reisner ideal of an expanded simplicial complex
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
• Graphs with many copies of a given subgraph
• The minimal non-Cohen-Macaulay monomial ideals
• Blow-up lemma
• Combinatorics and commutative algebra.
• Complemented zero-divisor graphs and Boolean rings
• Expansion of a simplicial complex
• On Vertex Decomposable Simplicial Complexes and Their Alexander Duals
• Vertex decomposable graphs and obstructions to shellability
• A New Construction for Cohen–Macaulay Graphs
• Monomial ideals whose powers have a linear resolution
• Monomial Ideals
• Complemented graphs and blow-ups of Boolean graphs, with applications to co-maximal ideal graphs
• Cohen-Macaulay edge ideal whose height is half of the number of vertices
• The Zero-Divisor Graphs Which Are Uniquely Determined By Neighborhoods

This page was built for publication: Boolean graphs are Cohen–Macaulay