Sunflower hypergraphs are chromatically unique (Q1877684)

The author corrects an error in the proof of the main result of the paper [\textit{M. Borowiecki} and \textit{E. Lazuka}, Discuss. Math., Graph Theory 20, 293--301 (2000; Zbl 0979.05044)]. There it was shown that for all \(k \geq 3\), the \(k\)-uniform hypergraphs such that all hyperedges contain a fixed set of \(k-1\) vertices, are chromatically unique. A hypergraph \(H\) is called chromatically unique, if any hypergraph having the same chromatic polynomial as \(H\) is isomorphic to \(H\).