ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph on the vertex set [d]={1,…,d}[d]=\{1,\ldots,d\} with d≥7d\geq 7, and let K[G]K[G] be its edge ring. Depth-seven conjecture.

depth⁡K[G]≥7.\operatorname{depth} K[G]\geq 7.

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 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.