ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a triangular cactus graph, meaning a cactus graph whose blocks are all 33-cycles, and let its diameter be the maximum distance between two vertices of GG. The (S2)(S_2)-condition conjecture. The edge ring associated to a triangular cactus graph of diameter at least 44 satisfies Serre's condition (S2)(S_2). This conjecture extends the known cases of triangular cactus graphs of diameter at most 33, whose edge rings are normal and Cohen--Macaulay; the paper proves the claim for triangular cactus graphs of diameter 44, while the general case 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.