On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
type: Item
instance of: scholarly article
title: On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
zbMATH Open document ID: 1113.05039
author: Ioan Tomescu
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
review text: 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\).
reviewed by: Klaus Dohmen
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 5130437
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatic uniqueness
MaRDI profile type: Publication
full work available at URL: j.disc.2006.07.026
OpenAlex ID: W2066861491
cites work: Q4099676
cites work: Chromatic polynomials of hypergraphs
cites work: On chromatic equivalence of graphs
cites work: Q4860309
cites work: Intersection Theorems for Systems of Sets
cites work: The search for chromatically unique graphs
cites work: Chromatic coefficients of linear uniform hypergraphs
cites work: Sunflower hypergraphs are chromatically unique
DOI: 10.1016/J.DISC.2006.07.026
description: scientific article; zbMATH DE number 5130437