Processing math: 100%

Your data matches 3 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000096
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000096: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 8
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 20
Description
The number of spanning trees of a graph. A subgraph H⊆G is a spanning tree if V(H)=V(G) and H is a tree (i.e. H is connected and contains no cycles).
Matching statistic: St000267
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000267: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 8
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 20
Description
The number of maximal spanning forests contained in a graph. A maximal spanning forest in a graph is a maximal acyclic subgraph. In other words, a spanning forest is a union of spanning trees in all connected components. See also [1] for this and further definitions. For connected graphs, this is the same as [[St000096]].
Matching statistic: St001607
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St001607: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,1,1]
 => 8
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [3,1]
 => 20
Description
The number of coloured graphs such that the multiplicities of colours are given by a partition. In particular, the value on the partition (n) is the number of unlabelled graphs on n vertices, [[oeis:A000088]], whereas the value on the partition (1n) is the number of labelled graphs [[oeis:A006125]].