List distinguishing index conjecture for connected graphs
Statement
Let be a connected graph, finite or infinite. For each edge , let be a list of available colours. The list distinguishing index is the minimum cardinal number such that every assignment of lists of cardinality admits a distinguishing edge colouring with for every edge . The distinguishing index is the minimum number of colours in a distinguishing edge colouring of .
List distinguishing index conjecture.
This conjecture extends the finite-graph vertex list-distinguishing conjecture to edge colourings and to connected infinite graphs. The source presents it as being motivated by the Ferrara–Flesch–Gethner conjecture and the List Colouring Conjecture; no resolution is given.
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.