On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.07.026 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066861491 / rank | |||
Normal rank |
Revision as of 21:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) |
scientific article |
Statements
On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (English)
0 references
2 March 2007
0 references
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\).
0 references
chromatic polynomial
0 references
chromatic uniqueness
0 references