Low–Roberts conjecture on connected simple Hartke magic graphs
Statement
Let be prime. A Hartke -magic graph is a graph with the Hartke magic-labeling property over ; its order is its number of vertices. Low–Roberts conjecture. For every integer , there exists a connected simple Hartke -magic graph of order . This conjecture was posed as a construction problem for Hartke magic graphs; the supplied text gives no resolution, so the existence claim remains open.
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.