ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, finite or infinite. For each edge e∈E(G)e\in E(G), let L(e)L(e) be a list of available colours. The list distinguishing index Dl′(G)D'_l(G) is the minimum cardinal number kk such that every assignment of lists of cardinality kk admits a distinguishing edge colouring cc with c(e)∈L(e)c(e)\in L(e) for every edge e∈E(G)e\in E(G). The distinguishing index D′(G)D'(G) is the minimum number of colours in a distinguishing edge colouring of GG.

List distinguishing index conjecture.

Dl′(G)=D′(G).D'_l(G)=D'(G).

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 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.