Majority Colourings of Digraphs
Combinatorics
2022-10-05 v1
Abstract
We prove that every digraph has a vertex 4-colouring such that for each vertex , at most half the out-neighbours of receive the same colour as . We then obtain several results related to the conjecture obtained by replacing 4 by 3.
Cite
@article{arxiv.1608.03040,
title = {Majority Colourings of Digraphs},
author = {Stephan Kreutzer and Sang-il Oum and Paul Seymour and Dominic van der Zypen and David R. Wood},
journal= {arXiv preprint arXiv:1608.03040},
year = {2022}
}