Neighborhood-prime conjecture for unions of cycles with one arbitrary component

For positive integers k1,,kk_1,\ldots,k_\ell and a positive integer nn, let CmC_m denote the cycle graph of length mm, and let \cup denote disjoint union.

Cycle-union conjecture. The union

C4k1C4k2C4kCnC_{4k_1}\cup C_{4k_2}\cup\cdots\cup C_{4k_\ell}\cup C_n

is neighborhood-prime if n0(mod4)n\equiv 0\pmod{4} or if nn 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.

Sources & referencesView supporting material

Primary source

John Asplund, N. Bradley Fox and Arran Hamm, “New Perspectives on Neighborhood-Prime Labelings of Graphs”, arXiv:1804.02473 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.