ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥1d\geq 1, let KK be an arbitrary field, and let GG be a graph on vertex set [n][n]. Primality and complete-intersection conjecture. If GG is (n−d)(n-d)-connected, then LGL_G is prime and a complete intersection. For d=2d=2, the corresponding result is known in the characteristic hypotheses stated in the paper; the general assertion is presented as suggested by experimental data 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 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.