Neighborhood-prime conjecture for unions of cycles with one arbitrary component
Statement
For positive integers and a positive integer , let denote the cycle graph of length , and let denote disjoint union.
Cycle-union conjecture. The union
is neighborhood-prime if or if is odd.
The conjecture is presented as a consequence that would follow from an affirmative solution of the Deretsky–Lee–Miller prime-labeling conjecture, together with the paper's neighborhood-graph theorem. The source does not report a resolution.
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.