ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite set of primes with #S≥2\#S\geq2, and let G\mathcal{G} be its SS-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 G\mathcal{G} of every sufficiently large even length. This is presented as a belief after the corresponding assertion is refuted for singleton sets SS; 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 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.