Sārā's maximal-clique bound for binomial edge ideals
Statement
Let be a graph, let , and let be its binomial edge ideal. Denote by the number of maximal cliques of . Sārā's conjecture.
This conjecture seeks to bound the regularity of a binomial edge ideal using the maximal-clique structure of its graph. The source notes that the bound follows from a known general estimate when and highlights the case ; no resolution is supplied.
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.