Jewel characterization conjecture for regularity of binomial edge ideals
Statement
Let be a tree, and let be its binomial edge ideal in . Denote by the number of internal vertices of , and let Jewel be the tree depicted in the source paper. Jewel characterization conjecture. The tree contains Jewel as a subgraph if and only if
The forward implication follows from the observation that a tree containing Jewel has regularity at least the number of internal vertices plus two; the converse was suggested by examples computed using SAGE and Macaulay 2 and remains conjectural.
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.