Alikhani–Soltani distinguishing-index conjecture for Mycielskians
Statement
Let be a connected graph with at least three vertices. Let denote the distinguishing index of , namely the least number of colors in a distinguishing edge coloring, and let denote the distinguishing index of its Mycielskian.
Alikhani–Soltani's conjecture. For all but a finite number of connected graphs with at least three vertices,
This conjecture predicts that the Mycielskian preserves the distinguishing index for all but finitely many connected graphs. The source gives an upper bound for twin-free graphs under additional hypotheses, but does not identify the finite exceptional family.
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.