ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For odd integers nn and kk with n≥3n\ge 3, consider the cycle CnC_n and the consecutive label set {k,k+1,…,k+n−1}\{k,k+1,\ldots,k+n-1\}. A prime labeling assigns these labels bijectively to the vertices of CnC_n so that adjacent vertices receive relatively prime labels. Schroeder's conjecture. If nn and kk are odd integers and n≥3n\ge 3, then CnC_n has a prime labeling using the labels k,k+1,…,k+n−1k,k+1,\ldots,k+n-1. This conjecture would imply the stated classification of prime 22-regular graphs, and the source reports it as open despite several partial results.

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.