"Gorenstein binomial edge ideals"

LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

We classify connected graphs G whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic. Click to show full abstract

We classify connected graphs G whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.

Keywords: binomial edge; gorenstein binomial; edge; edge ideals

Journal Title: Mathematische Nachrichten
Year Published: 2021

Link to full text (if available)

Share on Social Media: Sign Up to like & get
recommendations!
0

LAUSR

You are not signed in:

Sign Up!

Related content

More Information News Social Media Video Recommended