ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a countable graph, and assign to each vertex vv a list L(v)L(v) of available colors. The graph is majority kk-choosable if, for every such assignment with ∣L(v)∣=k|L(v)|=k, it has a majority coloring using a color from L(v)L(v) at each vertex, where at each vertex the number of incident monochromatic edges is at most the number of incident edges whose endpoints have different colors. List Unfriendly Partition Conjecture. Every countable graph is majority 22-choosable. This strengthens the Unfriendly Partition Conjecture. The paper proves the weaker bound that every countable graph is majority 44-choosable, so the conjectured bound remains open.

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.