Boolean graphs are Cohen–Macaulay

DOI10.1080/00927872.2018.1448839zbMATH Open1404.13029arXiv1611.07574OpenAlexW3101986180WikidataQ130028989 ScholiaQ130028989MaRDI QIDQ5376013FDOQ5376013

Authors: Aming Liu, Tongsuo Wu 

Publication date: 17 September 2018

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

Abstract: For each Boolean graph $B_n$, it is proved that both $B_n$ and its complement graph $overline{B}_n$ are vertex decomposable. It is also proved that $B_n$ is an unmixed graph, thus it is also Cohen-Macaulay.

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

Recommendations

• Cohen-Macaulay graphs
• Cohen-Macaulay bipartite graphs
• scientific article; zbMATH DE number 4065057
• On the Cayley graphs of Boolean functions
• Boolean graphs -- a survey
• Cohen-Macaulay circulant graphs
• A Construction of Cohen-Macaulay Graphs
• Cohen-Macaulayness of a class of graphs versus the class of their complements
• A note on Cohen-Macaulay graphs
• Cohen--Macaulay chordal graphs

zbMATH Keywords

vertex decomposable graphsCohen-Macaulay graphsBoolean graphsunmixed graphs

Mathematics Subject Classification ID

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

Cites Work

• Combinatorics and commutative algebra.
• On vertex decomposable simplicial complexes and their Alexander duals
• Title not available (Why is that?)
• Monomial ideals whose powers have a linear resolution
• Monomial Ideals
• Blow-up lemma
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
• Title not available (Why is that?)
• Vertex decomposable graphs and obstructions to shellability
• Cohen-Macaulay edge ideal whose height is half of the number of vertices
• Expansion of a simplicial complex
• On the Stanley-Reisner ideal of an expanded simplicial complex
• The minimal non-Cohen-Macaulay monomial ideals
• Complemented zero-divisor graphs and Boolean rings
• The Zero-Divisor Graphs Which Are Uniquely Determined By Neighborhoods
• Graphs with many copies of a given subgraph
• A new construction for Cohen-Macaulay graphs
• Complemented graphs and blow-ups of Boolean graphs, with applications to co-maximal ideal graphs

Cited In (9)

• A new view toward vertex decomposable graphs
• Complemented graphs and blow-ups of Boolean graphs, with applications to co-maximal ideal graphs
• A large class of graphs with a small subclass of Cohen-Macaulay members
• Closed neighborhood ideals of finite simple graphs
• Decomposable clutters and a generalization of Simon's conjecture
• Title not available (Why is that?)
• Sequentially Cohen-Macaulay path ideals of cycles
• Homotopy type of the Boolean complex of a Coxeter system.
• Cohen-Macaulay types of Cohen-Macaulay complexes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376013)