The longest induced cycle conjecture for unitary Cayley graphs
Statement
Let be the unitary Cayley graph considered in the paper, and let denote the maximum length of an induced cycle in when the underlying modulus has distinct prime factors. Longest induced cycle conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.