ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=Cn1∪⋯∪CnmG=C_{n_1}\cup\cdots\cup C_{n_m} be a 22-regular graph, where each ni≥3n_i\ge 3, and let a graph be prime when it admits a labeling by distinct integers from {1,2,…,∣V(G)∣}\{1,2,\ldots,|V(G)|\} such that adjacent vertices receive relatively prime labels. Tout–Dabboucy–Howalla conjecture. The graph GG is prime if and only if at most one of the integers nin_i is odd. The necessity is immediate from the independence number, and several partial cases are known; the full classification remains open in the source.

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.