On the chromaticity of sunflower hypergraphs 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\).
- Chromatic coefficients of linear uniform hypergraphs
- Chromatic polynomials of hypergraphs
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 833904 (Why is no real title available?)
- Intersection Theorems for Systems of Sets
- On chromatic equivalence of graphs
- Sunflower hypergraphs are chromatically unique
- The search for chromatically unique graphs
- On the chromaticity of multi-bridge hypergraphs
- Sunflower hypergraphs are chromatically unique
- Zero-free intervals of chromatic polynomials of hypergraphs
- On the chromaticity of quasi linear hypergraphs
- On extremal spectral radius of blow-up uniform hypergraphs
- Some results on chromaticity of quasilinear hypergraphs
- Problems on chromatic polynomials of hypergraphs
- On P-unique hypergraphs
- Hypergraphs with pendant paths are not chromatically unique
- Chromatic polynomials of some sunflower mixed hypergraphs
- Some properties of chromatic coefficients of linear uniform hypergraphs
- Series-parallel chromatic hypergraphs
This page was built for publication: On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868346)
