ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with no component isomorphic to K2K_2. An edge kk-list-weighting assigns to each edge a weight from an independently assigned list of kk real numbers. Let ch⁡Σe(G)\operatorname{ch}_\Sigma^e(G) be the least kk such that every assignment of lists of size kk 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 GG is nice, then

ch⁡Σe(G)≤3.\operatorname{ch}_\Sigma^e(G)\leq 3.

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