On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
From the author's abstract: A sunflower hypergraph SH\((n,p,h)\) is an \(h\)-hypergraph of order \(n = h + (k-1)p\) and size \(k\) (\(1\leq p\leq h-1\) and \(h\geq 3\)), where each edge consists of \(p\) distinct vertices and a common subset to all edges with \(h-p\) vertices. In this paper, the author shows that this hypergraph is \(h\)-chromatically unique (i.e., chromatically unique in the set of all \(h\)-hypergraphs) for every \(1\leq p\leq h-2\), but this is not true for \(p=h-1\) and \(k\geq 3\). Also SH\((n,p,h)\) is not chromatically unique for all \(p,k\geq 2\).
scientific article; zbMATH DE number 5130437