Abstract
A very well-covered graph is a well-covered graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. In this survey article, we gather together most of the old and new results on the edge and cover ideals of these graphs.
Original language | English |
---|---|
Article number | 29 |
Journal | Research in Mathematical Sciences |
Volume | 9 |
Issue number | 2 |
DOIs | |
Publication status | Published - Jun 2022 |
Keywords
- Betti number
- CM property
- Cohen–Macaulay graph
- Cohen–Macaulay ring
- Compression
- Cover ideal
- Depth
- Edge ideal
- Edge-weighted ideal
- f-Vector
- Flag complex
- h-Vector
- Height
- Independence complex
- Linear resolution
- Local cohomology
- Minimal free resolution
- Projective dimension
- Regularity
- Shellability
- Simplicial complex
- Stanley–Reisner ideal
- Symbolic power
- Vertex-decomposability
- Very well-covered graph
- Well-covered graph
ASJC Scopus subject areas
- Theoretical Computer Science
- Mathematics (miscellaneous)
- Computational Mathematics
- Applied Mathematics