A. Montejano

The balanced upper chromatic number of linear hypergraphs and the $n$-cube over $t$ elements

A coloring of the vertices of a hypergraph is called \emph{balanced} if the sizes of the color classes differ by at most one. We say that a hyperedge is \emph{rainbow} if its elements have pairwise distinct colors. In this paper, we provide a general upper bound on the \emph{balanced upper chromatic number} of arbitrar...