Schroeder's odd-start cycle labeling conjecture
Statement
For odd integers and with , consider the cycle and the consecutive label set . A prime labeling assigns these labels bijectively to the vertices of so that adjacent vertices receive relatively prime labels. Schroeder's conjecture. If and are odd integers and , then has a prime labeling using the labels . This conjecture would imply the stated classification of prime -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.