ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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. The source presents it as a conjecture posed in 2013, and the supplied material gives no resolution for arbitrary graphs.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.