Primality and complete-intersection conjecture for graph ideals

Let d1d\geq 1, let KK be an arbitrary field, and let GG be a graph on vertex set [n][n]. Primality and complete-intersection conjecture. If GG is (nd)(n-d)-connected, then LGL_G is prime and a complete intersection. For d=2d=2, the corresponding result is known in the characteristic hypotheses stated in the paper; the general assertion is presented as suggested by experimental data and remains open.

Sources & referencesView supporting material

Primary source

Jürgen Herzog, Antonio Macchia, Sara Saeedi Madani and Volkmar Welker, “On the ideal of orthogonal representations of a graph in R^2”, arXiv:1411.3674 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.