Majority choosability of countable graphs

Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk

In any vertex coloring of a graph some edges have differently colored ends (\emph{good} edges) and some are monochromatic (\emph{bad} edges). In a proper coloring all edges are goo…