2000 character limit reached
Edge rings of bipartite graphs with linear resolutions
Published 15 Aug 2019 in math.AC and math.CO | (1908.05678v1)
Abstract: Ohsugi and Hibi characterized the edge ring of a finite connected simple graph with a $2$-linear resolution. On the other hand, Hibi, Matsuda and the author conjectured that the edge ring of a finite connected simple graph with a $q$-linear resolution, where $q \geq 3$, is a hypersurface and proved the case $q=3$. In the present paper, we solve this conjecture for the case of finite connected simple bipartite graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.