The list Unfriendly Partition Conjecture for countable graphs
Statement
Let be a countable graph, and assign to each vertex a list of available colors. The graph is majority -choosable if, for every such assignment with , it has a majority coloring using a color from 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 -choosable. This strengthens the Unfriendly Partition Conjecture. The paper proves the weaker bound that every countable graph is majority -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.