Expected NF-number of disjoint union of finite copies of complete graph
From MaRDI portal
Publication:6877978
Cites work
- A Survey of Stanley–Reisner Theory
- A survey on Stanley depth
- Cohen-Macaulay graphs
- Cohen-Macaulay quotients of polynomial rings
- Conditions for virtually Cohen-Macaulay simplicial complexes
- Monomial Ideals
- Partitions of vertices and facets in trees and stacked simplicial complexes
- Regularity of powers of Stanley–Reisner ideals of one‐dimensional simplicial complexes
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Stanley-Reisner rings
- The \(\mathcal{NF}\)-number of two complete graphs joined by a common vertex
- The facet ideal of a simplicial complex
- The NF-Number of a Simplicial Complex
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Triangulations of polygons and stacked simplicial complexes: separating their Stanley-Reisner ideals
This page was built for publication: Expected \(\mathcal{NF}\)-number of disjoint union of finite copies of complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877978)