1 paper
Marcin Anholcer, BartÅomiej Bosek, JarosÅaw Grytczuk +3
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…