Depth of edge rings arising from finite graphs
From MaRDI portal
Publication:3103255
Recommendations
- Rings of graphs
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory
- On the depth of binomial edge ideals of graphs
- On some total graphs on finite rings
- Finite Euclidean graphs over rings
- Edge rings of bipartite graphs with linear resolutions
- scientific article; zbMATH DE number 15255
- Graphs from rings
- scientific article; zbMATH DE number 5841273
Cites work
Cited in
(12)- Betti numbers of toric ideals of graphs: a case study
- Comparing invariants of toric ideals of bipartite graphs
- Depth of initial ideals of normal edge rings
- Non-normal edge rings satisfying \((S_2)\)-condition
- Betti numbers of toric algebras of certain bipartite graphs
- Properties of the toric rings of a chordal bipartite family of graphs
- Edge rings satisfying Serre's condition \((R_{1})\)
- Algebraic properties of toric rings of graphs
- Non-normal affine monoid algebras
- Edge rings of bipartite graphs with linear resolutions
- Regularity and \(h\)-polynomials of toric ideals of graphs
- Splittings of toric ideals
This page was built for publication: Depth of edge rings arising from finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3103255)