Regularity formula for t-path ideals of unicyclic graphs
Statement
Let be a connected simple graph having at most one cycle of length . Let be a natural number. Write for the polynomial ring associated with , for its -path ideal, for the maximum number of pairwise suitable -paths in , and call -proximal when it satisfies the corresponding -proximity condition. Then
Regularity conjecture for t-path ideals. The displayed formula should hold. In particular,
when is a tree. This conjecture is presented as a natural generalization of the paper's theorem for -path ideals; the supplied text gives no resolution status for the general -path statement.
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.