Bartnicki–Grytczuk–Niwczyk list 1-2-3 Conjecture
Statement
Let be a graph with no component isomorphic to . An edge -list-weighting assigns to each edge a weight from an independently assigned list of real numbers. Let be the least such that every assignment of lists of size to the edges permits an edge list-weighting giving different incident-edge sums to adjacent vertices. Bartnicki–Grytczuk–Niwczyk's list 1-2-3 Conjecture. If is nice, then
This strengthens the ordinary 1-2-3 Conjecture by allowing arbitrary edge lists. The paper states it as a conjecture and develops sequence analogues, so it remains open in the source.
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.