Affiliation:
1. Mathematical Institute University of Oxford Oxford UK
2. School of Mathematics Monash University Melbourne Victoria Australia
Abstract
AbstractWe prove that the vertices of every ‐uniform hypergraph with maximum degree may be colored with colors such that each vertex is in at most monochromatic edges. This result, which is best possible up to the value of the constant , generalizes the classical result of Erdős and Lovász who proved the case.
Funder
Australian Research Council
Engineering and Physical Sciences Research Council
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software