ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XnX_n be the unitary Cayley graph considered in the paper, and let m(r)m(r) denote the maximum length of an induced cycle in XnX_n when the underlying modulus has rr distinct prime factors. Longest induced cycle conjecture.

m(r)=2r+2.m(r)=2^r+2.

The conjecture is based on exhaustive computer searches of arrays representing induced cycles and suggests an exact formula for the longest induced cycle. The surrounding discussion also indicates that the result may extend to related conjunctions of complete multipartite graphs, but no proof or resolution is given here.

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.