The v-number conjecture for crown graphs
Statement
Let with . The graph is the crown graph obtained from the complete bipartite graph on two parts of size by deleting a perfect matching, and denotes its binomial edge ideal. For , let be the corresponding prime ideal and let denote the local v-number of at . The v-number conjecture for crown graphs. For every ,
This would establish the expected upper value in the bound for crown graphs with ; the case is already known, while the assertion for every cut-set prime remains open.
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.