Identifier
Values
['A',1] => ([],1) => ([],1) => 1
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => 1
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => 2
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => 3
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 2
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of distinct colouring schemes of a graph.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the number of distinct partitions that occur.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the number of distinct partitions that occur.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$.
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!