Regularity bound by the number of maximal cliques for binomial edge ideals
Statement
Let be a graph, let be the polynomial ring over a field , and let be its binomial edge ideal. Let denote the number of maximal cliques of , and let
The clique-count regularity conjecture. For every graph ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.