The list 1-2-3 conjecture for graphs
Statement
Let be a graph without isolated edges. Assign to every edge a list of three real numbers. A weighting from the lists is a function such that each belongs to the list assigned to . Define the induced vertex weight by
The list 1-2-3 conjecture. For every graph without isolated edges and every assignment of lists of size to the edges of , there exists a weighting from the lists such that the induced vertex weights properly color .
This is a list strengthening of the 1-2-3 conjecture, motivated by an application of Alon's Combinatorial Nullstellensatz and attributed in the source to Bartnicki, Grytczuk and Niwczyk. The source explicitly states that the conjecture is open, including when larger lists of some fixed size are allowed.
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.