Mrs. Correct and Majority Colorings
Combinatorics
2025-05-26 v3
Abstract
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 techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for paintability - an on-line analog of the list coloring.
Cite
@article{arxiv.2207.09739,
title = {Mrs. Correct and Majority Colorings},
author = {Marcin Anholcer and Bartłomiej Bosek and Jarosław Grytczuk and Grzegorz Gutowski and Jakub Przybyło and Mariusz Zając},
journal= {arXiv preprint arXiv:2207.09739},
year = {2025}
}