Minimal-cycle Betti-number conjecture for graph curves
Statement
Let be a graph on vertices, embedded as in Theorem 1.3. Let denote the girth of , and suppose that and . Minimal-cycle Betti-number conjecture. The property fails, and is equal to the number of cycles of length in . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.