Chromatic polynomials of hypergraphs (Q5890237)

Let \(q\geq 2\) and \(H_{q,q+1}^{n}\) be the \((q+1)\)-uniform hypergraph having vertex set \(X\) with \(|X|=n \geq q+1\) and edge set consisting of all sets \(Y\cup \{x_{i}\}\) for \(1\leq i\leq n-q \), where \(Y\subset X\), \(|Y|=q\) and \(\{x_{1},\ldots ,x_{n-q}\}\cup Y=X\). The main result of this paper is the proof that \(H_{q,q+1}^{n}\) is chromatically unique, i.e., it is uniquelly determined (up to isomorphism) by its chromatic polynomial, given in the paper.