Depth-seven conjecture for edge rings of finite graphs
Statement
Let be a finite graph on the vertex set with , and let be its edge ring. Depth-seven conjecture.
The claim arises from computations showing that connected nonbipartite graphs with seven vertices have edge rings of depth at least seven. The preceding discussion presents it as a temptation rather than an established theorem; the supplied status gives no evidence of resolution.
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.