A contribution to the chromatic theory of uniform hypergraphs (Q1896647): Difference between revisions

Let \(H\) be a hypergraph and \(P_H (\lambda)\) denote the number of proper \(\lambda\)-colourings of \(H\), where `proper' means that the only monochromatic edges are loops. For uniform hypergraphs \(H\), lower bounds and upper bounds on \(P_H (\lambda)\) are obtained in terms of the rank, the number of vertices and edges and some arbitrary number less than the girth. If \(H\) has \(m > 1\) edges and is uniform of rank \(r > 1\), it follows that \(\chi (H) \leq \lceil \root {r - 1} \of m \rceil\), where \(\chi (H)\) denotes the chromatic number of \(H\). It should be noted that the bounds on \(P_H (\lambda)\) are new for graphs, too.