On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4099676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic polynomials of hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On chromatic equivalence of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4860309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection Theorems for Systems of Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The search for chromatically unique graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic coefficients of linear uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sunflower hypergraphs are chromatically unique / rank | |||
Normal rank |
Latest revision as of 15:24, 25 June 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