← All problems

Regularity bound by the number of maximal cliques for binomial edge ideals

5 years old · documented by

Let GG be a graph, let S=K[x1,…,xn,y1,…,yn]S={\mathbb K}[x_1,\ldots,x_n,y_1,\ldots,y_n] be the polynomial ring over a field K{\mathbb K}, and let JG⊆SJ_G\subseteq S be its binomial edge ideal. Let c(G)c(G) denote the number of maximal cliques of GG, and let

reg⁡S/JG=max⁡{j−i:βi,j(S/JG)≠0}.\operatorname{reg} S/J_G=\max\{j-i:\beta_{i,j}(S/J_G)\neq 0\}.

The clique-count regularity conjecture. For every graph GG,

reg⁡S/JG≤c(G).\operatorname{reg} S/J_G\leq c(G).

The bound is known for closed, or proper interval, graphs.

References

Status

  • Solved: M. Rouzbahani Malayeri, S. Saeedi Madani, and D. Kiani. A proof for a conjecture on the regularity of binomial edge ideals (arXiv preprint (math.AC, math.CO), 2020) https://arxiv.org/abs/2007.09959

Source: M. Rouzbahani Malayeri, S. Saeedi Madani and D. Kiani, “A proof for a conjecture on the regularity of binomial edge ideals”, arXiv:2007.09959 (2020).

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.