Abstract
A general forniulation of hypergraph colorings is given as an introduction. In addition, this note presents an extension of a known coloring property of unimodular hypergraphs; in particular it implies that a unimodular hypergraph with maximum degree d has ari equitable k-coloring (S1,…,S k ) with 1 + (d − 1)|S k |≧|S1|≧…≧|S k |. Moreover this also holds with the same d for some transformations of H (although the rnaximum degree may be increased). An adaptation to balanced hypergraphs is given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
