Depth of edge rings arising from finite graphs
classification
🧮 math.AC
keywords
finitedepthedgegrapharisingbasesexistsgiven
read the original abstract
Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the technique of Gr\"obner bases and initial ideals, it will be proved that, given integers $f$ and $d$ with $7 \leq f \leq d$, there exists a finite graph $G$ on $[d]={1,...,d}$ with $\depth K[G] = f$ and with $\Krull-dim K[G] = d$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.