Chromatic polynomials of hypergraphs (Q5920448)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5240256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic polynomials of hypergraphs |
scientific article; zbMATH DE number 5240256 |
Statements
Chromatic polynomials of hypergraphs (English)
0 references
25 February 2008
0 references
The authors investigate the number of \(\lambda\)-colourings of the vertices of a hypergraph \(H\) such that each edge \(e_i\) of \(H\) contains at least \(x_i\) differently coloured vertices for given quantities \(x_1,\dots,x_m\) (one for each edge). They show that the number of such colourings can be expressed as a polynomial of degree \(n\) (the number of vertices of \(H\)) and as a sum of chromatic polynomials, and present a reduction formula generalizing similar formulae for standard colourings of graphs and hypergraphs.
0 references
hypergraphs
0 references
colourings
0 references
chromatic polynomials of hypergraphs
0 references
chromatic coefficients
0 references
partitions in hypergraphs
0 references
0.9430315494537354
0 references
0.8339467644691467
0 references
0.8284740447998047
0 references
0.8274781703948975
0 references
0.8212632536888123
0 references
