The random-graph clone conjecture for total difference labeling
Statement
Let be a random graph in the Erdős–Rényi model, and let be its clone. Write for the total difference labeling number of .
Random-graph clone conjecture. For every , with probability ,
This conjecture asks whether the general upper bound for the total difference labeling number of a clone is asymptotically close to equality for Erdős–Rényi random graphs. The supplied text gives no resolution evidence, so its status 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.