ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph without isolated edges. Assign to every edge a list of three real numbers. A weighting from the lists is a function ω:E(G)→R\omega:E(G)\to\mathbb{R} such that each ω(e)\omega(e) belongs to the list assigned to ee. Define the induced vertex weight by

ω(v):=∑u∈N(v)ω(uv).\omega(v):=\sum_{u\in N(v)}\omega(uv).

The list 1-2-3 conjecture. For every graph GG without isolated edges and every assignment of lists of size 33 to the edges of GG, there exists a weighting ω:E(G)→R\omega:E(G)\to\mathbb{R} from the lists such that the induced vertex weights properly color V(G)V(G).

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