coloring;
hypergraphs;
Lovasz local lemma;
JUDICIOUS PARTITIONS;
D O I:
10.1002/rsa.21190
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
We prove that the vertices of every (r+1)-uniform hypergraph with maximum degree Delta may be colored with c(Delta/d+1)(1/r) colors such that each vertex is in at most d monochromatic edges. This result, which is best possible up to the value of the constant c , generalizes the classical result of Erdos and Lovasz who proved the d=0 case.