ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be the set of positive integers under consideration in the paper, let T1={22,58,70,82,142,190,298,330,358,382,478,658,742,862,1222,1978}T_1=\{22,58,70,82,142,190,298,330,358,382,478,658,742,862,1222,1978\}, and let C3(t)C_3(t) denote the number of 5-cycles in the relevant graph associated with tt. The conjecture on 5-cycles. For all t∈T∖T1t\in T\setminus T_1, C3(t)=5C_3(t)=5. This conjecture asserts that the exhaustive computation identifying the exceptional values T1T_1 captures every case in which the number of 5-cycles exceeds five; its validity beyond the computational range 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.