Seyed Fakhari–Kiani clique-bound conjecture for binomial edge ideals
Statement
Let be a graph, let be its binomial edge ideal, and let be the number of maximal cliques of . Seyed Fakhari–Kiani's conjecture.
This conjecture is proposed as an upper bound for the regularity of binomial edge ideals in terms of the maximal-clique structure of the graph. The source does not provide evidence there that the conjecture has been resolved.
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.