Universally Koszul algebras defined by graphs
Rashid Zaare-Nahandi

TL;DR
This paper characterizes graphs whose edge rings are universally Koszul, showing they are exactly the (2K_2, P_4)-free graphs, and demonstrates that these algebras have linear minimal free resolutions.
Contribution
It establishes a precise graph-theoretic characterization of universally Koszul edge rings and proves their linear minimal free resolutions.
Findings
Graphs are (2K_2, P_4)-free if and only if their edge rings are universally Koszul
Universally Koszul algebras have linear minimal free resolutions
Characterization links graph properties to algebraic properties
Abstract
In this note, it is proved that a graphs is -free if and only if its edge ring is universally Koszul. Using properties of this family of graphs, we show that Universally Koszul algebras defined by graphs have linear minimal free resolution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
