3:30 pm
Bounds on Castelnuovo-Mumford regularity of edge ideals of simple graphs
Arindam Banerjee
University of Virginia, USA.
23-07-13

---

Abstract

The relation between combinatorics of simple graphs and algebra of their edge ideals has been the focus of many recent works. It has been shown by Froberg that edge ideal has a linear minimal free resolution if the complement graph has no induced cycle other than triangles. Not much is known about regularity of edge ideals of graphs with various other combinatorial structures and even less is known about regularities of powers of edge ideals. In this talk some recent progress in these problems will be discussed.