ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on dd vertices, embedded as in Theorem 1.3. Let nn denote the girth of GG, and suppose that d=2g+1+pd=2g+1+p and n−2≤pn-2\leq p. Minimal-cycle Betti-number conjecture. The property N2,pN_{2,p} fails, and βn−2,n\beta_{n-2,n} is equal to the number of cycles of length nn in GG. This predicts that a graded Betti number records the number of shortest cycles in the graph under the stated numerical hypotheses.

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.