Edgewise strongly shellable clutters

DOI10.1142/S0219498818500184MaRDI QIDQ4599711zbMATH OpenOpenAlexFDO

Authors Jin Guo, Yi-Huang Shen, Tongsuo Wu

Publication date 4 January 2018

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

chordal graphslinear resolutioncluttersstrong shellability

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45) Cohen-Macaulay modules (13C14)

Abstract: When $mathcalC$ is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable. When $mathcalC$ is indeed a finite simple graph, we study various characterizations of chordal graphs from the point of view of strong shellability. In particular, the generic graph $G_T$ of a tree is shown to be bi-strongly shellable. We also characterize edgewise strongly shellable bipartite graphs in terms of constructions from upward sequences. end{abstract}

Recommendations

• Chordal and sequentially Cohen-Macaulay clutters
• Shellability of simple graphs and hypergraphs containing a simplicial vertex
• Exposed circuits, linear quotients, and chordal clutters
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
• The complement of a \(d\)-tree is pure shellable

Cites work

• scientific article; zbMATH DE number 16165 (Why is no real title available?)
• A class of hypergraphs that generalizes chordal graphs
• Bi-Cohen-Macaulay graphs
• Chordal and sequentially Cohen-Macaulay clutters
• Cohen-Macaulay monomial ideals of codimension 2
• Combinatorics and commutative algebra.
• Digraphs
• Expansion of a simplicial complex
• Incidence matrices and interval graphs
• Monomial Ideals
• On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint
• On rigid circuit graphs
• On the Stanley-Reisner ideal of an expanded simplicial complex
• Resolutions by mapping cones
• Some algebraic properties of hypergraphs.
• Stability of Betti numbers under reduction processes: towards chordality of clutters
• Strong shellability of simplicial complexes
• Triangulated graphs and the elimination process

Cited in

(5)

• The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves
• The complement of a \(d\)-tree is pure shellable
• Chordal and sequentially Cohen-Macaulay clutters
• Strong shellability of simplicial complexes
• Shellability of simple graphs and hypergraphs containing a simplicial vertex

This page was built for publication: Edgewise strongly shellable clutters

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