ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with at least three vertices. Let Dist⁡′(G)\operatorname{Dist}'(G) denote the distinguishing index of GG, namely the least number of colors in a distinguishing edge coloring, and let Dist⁡′(μ(G))\operatorname{Dist}'(\mu(G)) denote the distinguishing index of its Mycielskian.

Alikhani–Soltani's conjecture. For all but a finite number of connected graphs GG with at least three vertices,

Dist⁡′(μ(G))≤Dist⁡′(G).\operatorname{Dist}'(\mu(G)) \leq \operatorname{Dist}'(G).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.