Call a graph G of order n prime if its vertices can be bijectively labelled by 1,\ldots,n so that adjacent vertices receive coprime labels.
Statement
Call a graph G of order n prime if its vertices can be bijectively labelled by 1,\ldots,n so that adjacent vertices receive coprime labels. Is every tree prime?
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.