Indexed metadata
Majority Colourings of Digraphs
Stephan Kreutzer, Sang-il Oum, Paul Seymour, Dominic Van der Zypen, David R. Wood
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.