41 problems
Let be a connected non-bipartite graph, let be the polynomial ring associated to its vertices, and let be the edge ideal of . Depth-drop conjecture. If…
Let be a connected graph, let be the polynomial ring associated to its vertices, let be the edge ideal of , and let be the homogeneous…
Let be the wheel graph on vertices, let be its edge ideal in , and let denote its matching…
Associated-prime extension conjecture. Every associated prime of is of the form
Let be the edge ideal of the complement of the generalized Andrásfai graph , and let denote its graded Betti n…
Product bounds conjecture. The following inequalities hold:
Let be a connected graph, and let be its complementary edge ideal. For each , let denote the -th homological shift ideal of the R…
Let be a finite simple graph, and let denote its complementary edge ideal in the polynomial ring associated to . Write for the Rees algebra of…
Symmetric exchange conjecture. The toric ideal
Let be a chordal graph, let be its edge ideal, let denote its -th square-free power, let be its matching number, and let be…
Let be a simple graph on vertex set , let , and let be the edge ideal of the -th power of , where is a positive integer. T…
Let be a weighted tree. Proposition gives necessary conditions for to be Cohen–Macaulay for all : has a perfect matching…
Asymptotic associated-prime conjecture. For all ,
Let be a graph with edge ideal . Suppose that, for some integer , has linear quotients with an ordering of its g…
Let be a finite simple graph with vertex set , let be a polynomial ring over a field , and let be the edge ideal…
Linear quotients conjecture for symbolic powers. If has a linear resolution, then has linear quotients for every .
Componentwise linear symbolic power conjecture. If has a linear resolution, then is componentwise linear for every .
Let , , and be as above, and for each let denote the number of positive integers satisfying . Hilbert-depth frequency conje…
Let be the graph obtained by attaching a whisker to each vertex of the cycle , let be its edge ideal in the corresponding polynomial ring…
Let be a cycle of length , let be its edge ideal in the corresponding polynomial ring , and let denote its matching nu…
Let be a graph on vertices and let , where is obtained by duplicating the vertices of according to…
Let be a weighted oriented graph whose underlying graph is triangle-free, meaning that contains no cycles of length . The graph is Cohen…
Restricted bipartite connectivity conjecture. The stable value of the depth of the symbolic powers of is
Terai's conjecture. The ideal is sequentially Cohen–Macaulay for every weight function . This conjecture extends questions about Cohen–Macaulayness an…
Let be a graph, let denote its edge ideal, let denote the squarefree part of its -th symbolic power, and let denote the matching numbe…