Vanishing of cubical homology for graphs without triangles or quadrilaterals
Statement
Let be an undirected graph, and let denote its -th cubical homology group. Suppose that contains no -cycles and no -cycles. Cubical vanishing conjecture. Then
for . The analogous statement for path homology was proved immediately beforehand; the cubical version is supported only by limited computational evidence and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.