Your data matches 82 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000228
(load all 6 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => [1]
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [4,1]
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => [5]
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => [5,1]
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => [5,1]
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => [5,1]
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => [6]
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => [6,1]
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => [7]
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => [6,1]
 => 7
Description
The size of a partition. This statistic is the constant statistic of the level sets.
Matching statistic: St000459
(load all 3 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000459: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => [1]
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [4,1]
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => [5]
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => [5,1]
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => [5,1]
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => [5,1]
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => [6]
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => [6,1]
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => [7]
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => [6,1]
 => 7
Description
The hook length of the base cell of a partition. This is also known as the perimeter of a partition. In particular, the perimeter of the empty partition is zero.
Matching statistic: St000460
(load all 3 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000460: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => [1]
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [4,1]
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => [5]
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => [5,1]
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => [5,1]
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => [5,1]
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => [6]
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => [6,1]
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => [7]
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => [6,1]
 => 7
Description
The hook length of the last cell along the main diagonal of an integer partition.
Matching statistic: St000479
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000479: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(5,6)],7)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([],7)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(5,6)],7)
 => 7
Description
The Ramsey number of a graph. This is the smallest integer $n$ such that every two-colouring of the edges of the complete graph $K_n$ contains a (not necessarily induced) monochromatic copy of the given graph. [1] Thus, the Ramsey number of the complete graph $K_n$ is the ordinary Ramsey number $R(n,n)$. Very few of these numbers are known, in particular, it is only known that $43\leq R(5,5)\leq 48$. [2,3,4,5]
Matching statistic: St000870
(load all 3 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000870: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => [1]
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [4,1]
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => [5]
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => [5,1]
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => [5,1]
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => [5,1]
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => [6]
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => [5,1]
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => [6,1]
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => [7]
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => [6,1]
 => 7
Description
The product of the hook lengths of the diagonal cells in an integer partition. For a cell in the Ferrers diagram of a partition, the hook length is given by the number of boxes to its right plus the number of boxes below + 1. This statistic is the product of the hook lengths of the diagonal cells $(i,i)$ of a partition.
Matching statistic: St001318
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001318: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(5,6)],7)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([],7)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(5,6)],7)
 => 7
Description
The number of vertices of the largest induced subforest with the same number of connected components of a graph.
Matching statistic: St001321
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001321: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(5,6)],7)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([],7)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(5,6)],7)
 => 7
Description
The number of vertices of the largest induced subforest of a graph.
Matching statistic: St001342
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001342: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(5,6)],7)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([],7)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(5,6)],7)
 => 7
Description
The number of vertices in the center of a graph. The center of a graph is the set of vertices whose maximal distance to any other vertex is minimal. In particular, if the graph is disconnected, all vertices are in the certer.
Matching statistic: St001615
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001615: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,7),(2,8),(3,8),(4,5),(5,1),(6,4),(7,2),(7,3),(8,6)],9)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,6),(2,8),(3,8),(4,7),(5,1),(6,4),(7,2),(7,3),(8,5)],9)
 => 7
Description
The number of join prime elements of a lattice. An element $x$ of a lattice $L$ is join-prime (or coprime) if $x \leq a \vee b$ implies $x \leq a$ or $x \leq b$ for every $a, b \in L$.
Matching statistic: St001617
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001617: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => 5
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9)
 => 6
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8)
 => 6
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
 => 6
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8)
 => 6
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9)
 => 6
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
 => ([(0,7),(2,8),(3,8),(4,5),(5,1),(6,4),(7,2),(7,3),(8,6)],9)
 => 7
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ([(0,6),(2,8),(3,8),(4,7),(5,1),(6,4),(7,2),(7,3),(8,5)],9)
 => 7
Description
The dimension of the space of valuations of a lattice. A valuation, or modular function, on a lattice $L$ is a function $v:L\mapsto\mathbb R$ satisfying $$ v(a\vee b) + v(a\wedge b) = v(a) + v(b). $$ It was shown by Birkhoff [1, thm. X.2], that a lattice with a positive valuation must be modular. This was sharpened by Fleischer and Traynor [2, thm. 1], which states that the modular functions on an arbitrary lattice are in bijection with the modular functions on its modular quotient [[Mp00196]]. Moreover, Birkhoff [1, thm. X.2] showed that the dimension of the space of modular functions equals the number of subsets of projective prime intervals.
The following 72 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001622The number of join-irreducible elements of a lattice. St001672The restrained domination number of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St000271The chromatic index of a graph. St000293The number of inversions of a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000548The number of different non-empty partial sums of an integer partition. St000734The last entry in the first row of a standard tableau. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001249Sum of the odd parts of a partition. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001746The coalition number of a graph. St000171The degree of the graph. St000543The size of the conjugacy class of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000921The number of internal inversions of a binary word. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001120The length of a longest path in a graph. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000301The number of facets of the stable set polytope of a graph. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000947The major index east count of a Dyck path. St000806The semiperimeter of the associated bargraph. St000867The sum of the hook lengths in the first row of an integer partition. St001717The largest size of an interval in a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001645The pebbling number of a connected graph. St000189The number of elements in the poset. St000656The number of cuts of a poset. St000144The pyramid weight of the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001118The acyclic chromatic index of a graph. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001725The harmonious chromatic number of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St000005The bounce statistic of a Dyck path. St001117The game chromatic index of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001706The number of closed sets in a graph. St001875The number of simple modules with projective dimension at most 1. St000528The height of a poset. St000912The number of maximal antichains in a poset. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000080The rank of the poset. St001651The Frankl number of a lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000327The number of cover relations in a poset. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset.