The conjecture on nondegenerate induced cycles for sets with at least two primes
Statement
Let be a finite set of primes with , and let be its -unit graph. A cycle is nondegenerate if its edge differences have no proper nonempty zero subsum, and induced if it has no edges between nonconsecutive vertices. The conjecture. There are nondegenerate induced cycles of of every sufficiently large even length. This is presented as a belief after the corresponding assertion is refuted for singleton sets ; no resolution is supplied.
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.