searching the database
Your data matches 72 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000989
(load all 39 compositions to match this statistic)
(load all 39 compositions to match this statistic)
St000989: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 1
[2,1] => 0
[1,2,3] => 2
[1,3,2] => 0
[2,1,3] => 1
[2,3,1] => 0
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 3
[1,2,4,3] => 0
[1,3,2,4] => 1
[1,3,4,2] => 0
[1,4,2,3] => 1
[1,4,3,2] => 0
[2,1,3,4] => 2
[2,1,4,3] => 0
[2,3,1,4] => 1
[2,3,4,1] => 0
[2,4,1,3] => 1
[2,4,3,1] => 0
[3,1,2,4] => 2
[3,1,4,2] => 0
[3,2,1,4] => 1
[3,2,4,1] => 0
[3,4,1,2] => 1
[3,4,2,1] => 0
[4,1,2,3] => 2
[4,1,3,2] => 0
[4,2,1,3] => 1
[4,2,3,1] => 0
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 4
[1,2,3,5,4] => 0
[1,2,4,3,5] => 1
[1,2,4,5,3] => 0
[1,2,5,3,4] => 1
[1,2,5,4,3] => 0
[1,3,2,4,5] => 2
[1,3,2,5,4] => 0
[1,3,4,2,5] => 1
[1,3,4,5,2] => 0
[1,3,5,2,4] => 1
[1,3,5,4,2] => 0
[1,4,2,3,5] => 2
[1,4,2,5,3] => 0
[1,4,3,2,5] => 1
[1,4,3,5,2] => 0
[1,4,5,2,3] => 1
[1,4,5,3,2] => 0
Description
The number of final rises of a permutation.
For a permutation $\pi$ of length $n$, this is the maximal $k$ such that
$$\pi(n-k) \leq \pi(n-k+1) \leq \cdots \leq \pi(n-1) \leq \pi(n).$$
Equivalently, this is $n-1$ minus the position of the last descent [[St000653]].
Matching statistic: St000383
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => 2 = 1 + 1
[2,1] => [1,1] => 1 = 0 + 1
[1,2,3] => [3] => 3 = 2 + 1
[1,3,2] => [2,1] => 1 = 0 + 1
[2,1,3] => [1,2] => 2 = 1 + 1
[2,3,1] => [2,1] => 1 = 0 + 1
[3,1,2] => [1,2] => 2 = 1 + 1
[3,2,1] => [1,1,1] => 1 = 0 + 1
[1,2,3,4] => [4] => 4 = 3 + 1
[1,2,4,3] => [3,1] => 1 = 0 + 1
[1,3,2,4] => [2,2] => 2 = 1 + 1
[1,3,4,2] => [3,1] => 1 = 0 + 1
[1,4,2,3] => [2,2] => 2 = 1 + 1
[1,4,3,2] => [2,1,1] => 1 = 0 + 1
[2,1,3,4] => [1,3] => 3 = 2 + 1
[2,1,4,3] => [1,2,1] => 1 = 0 + 1
[2,3,1,4] => [2,2] => 2 = 1 + 1
[2,3,4,1] => [3,1] => 1 = 0 + 1
[2,4,1,3] => [2,2] => 2 = 1 + 1
[2,4,3,1] => [2,1,1] => 1 = 0 + 1
[3,1,2,4] => [1,3] => 3 = 2 + 1
[3,1,4,2] => [1,2,1] => 1 = 0 + 1
[3,2,1,4] => [1,1,2] => 2 = 1 + 1
[3,2,4,1] => [1,2,1] => 1 = 0 + 1
[3,4,1,2] => [2,2] => 2 = 1 + 1
[3,4,2,1] => [2,1,1] => 1 = 0 + 1
[4,1,2,3] => [1,3] => 3 = 2 + 1
[4,1,3,2] => [1,2,1] => 1 = 0 + 1
[4,2,1,3] => [1,1,2] => 2 = 1 + 1
[4,2,3,1] => [1,2,1] => 1 = 0 + 1
[4,3,1,2] => [1,1,2] => 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => 1 = 0 + 1
[1,2,3,4,5] => [5] => 5 = 4 + 1
[1,2,3,5,4] => [4,1] => 1 = 0 + 1
[1,2,4,3,5] => [3,2] => 2 = 1 + 1
[1,2,4,5,3] => [4,1] => 1 = 0 + 1
[1,2,5,3,4] => [3,2] => 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => 1 = 0 + 1
[1,3,2,4,5] => [2,3] => 3 = 2 + 1
[1,3,2,5,4] => [2,2,1] => 1 = 0 + 1
[1,3,4,2,5] => [3,2] => 2 = 1 + 1
[1,3,4,5,2] => [4,1] => 1 = 0 + 1
[1,3,5,2,4] => [3,2] => 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => 1 = 0 + 1
[1,4,2,3,5] => [2,3] => 3 = 2 + 1
[1,4,2,5,3] => [2,2,1] => 1 = 0 + 1
[1,4,3,2,5] => [2,1,2] => 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => 1 = 0 + 1
[1,4,5,2,3] => [3,2] => 2 = 1 + 1
[1,4,5,3,2] => [3,1,1] => 1 = 0 + 1
Description
The last part of an integer composition.
Matching statistic: St000297
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00109: Permutations —descent word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => 1 => 1
[2,1] => [1,2] => 0 => 0
[1,2,3] => [3,2,1] => 11 => 2
[1,3,2] => [2,3,1] => 01 => 0
[2,1,3] => [3,1,2] => 10 => 1
[2,3,1] => [1,3,2] => 01 => 0
[3,1,2] => [2,1,3] => 10 => 1
[3,2,1] => [1,2,3] => 00 => 0
[1,2,3,4] => [4,3,2,1] => 111 => 3
[1,2,4,3] => [3,4,2,1] => 011 => 0
[1,3,2,4] => [4,2,3,1] => 101 => 1
[1,3,4,2] => [2,4,3,1] => 011 => 0
[1,4,2,3] => [3,2,4,1] => 101 => 1
[1,4,3,2] => [2,3,4,1] => 001 => 0
[2,1,3,4] => [4,3,1,2] => 110 => 2
[2,1,4,3] => [3,4,1,2] => 010 => 0
[2,3,1,4] => [4,1,3,2] => 101 => 1
[2,3,4,1] => [1,4,3,2] => 011 => 0
[2,4,1,3] => [3,1,4,2] => 101 => 1
[2,4,3,1] => [1,3,4,2] => 001 => 0
[3,1,2,4] => [4,2,1,3] => 110 => 2
[3,1,4,2] => [2,4,1,3] => 010 => 0
[3,2,1,4] => [4,1,2,3] => 100 => 1
[3,2,4,1] => [1,4,2,3] => 010 => 0
[3,4,1,2] => [2,1,4,3] => 101 => 1
[3,4,2,1] => [1,2,4,3] => 001 => 0
[4,1,2,3] => [3,2,1,4] => 110 => 2
[4,1,3,2] => [2,3,1,4] => 010 => 0
[4,2,1,3] => [3,1,2,4] => 100 => 1
[4,2,3,1] => [1,3,2,4] => 010 => 0
[4,3,1,2] => [2,1,3,4] => 100 => 1
[4,3,2,1] => [1,2,3,4] => 000 => 0
[1,2,3,4,5] => [5,4,3,2,1] => 1111 => 4
[1,2,3,5,4] => [4,5,3,2,1] => 0111 => 0
[1,2,4,3,5] => [5,3,4,2,1] => 1011 => 1
[1,2,4,5,3] => [3,5,4,2,1] => 0111 => 0
[1,2,5,3,4] => [4,3,5,2,1] => 1011 => 1
[1,2,5,4,3] => [3,4,5,2,1] => 0011 => 0
[1,3,2,4,5] => [5,4,2,3,1] => 1101 => 2
[1,3,2,5,4] => [4,5,2,3,1] => 0101 => 0
[1,3,4,2,5] => [5,2,4,3,1] => 1011 => 1
[1,3,4,5,2] => [2,5,4,3,1] => 0111 => 0
[1,3,5,2,4] => [4,2,5,3,1] => 1011 => 1
[1,3,5,4,2] => [2,4,5,3,1] => 0011 => 0
[1,4,2,3,5] => [5,3,2,4,1] => 1101 => 2
[1,4,2,5,3] => [3,5,2,4,1] => 0101 => 0
[1,4,3,2,5] => [5,2,3,4,1] => 1001 => 1
[1,4,3,5,2] => [2,5,3,4,1] => 0101 => 0
[1,4,5,2,3] => [3,2,5,4,1] => 1011 => 1
[1,4,5,3,2] => [2,3,5,4,1] => 0011 => 0
Description
The number of leading ones in a binary word.
Matching statistic: St000273
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => ([],2)
=> 2 = 1 + 1
[2,1] => [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,2,3] => [3] => ([],3)
=> 3 = 2 + 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[1,2,3,4] => [4] => ([],4)
=> 4 = 3 + 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,2,3,4,5] => [5] => ([],5)
=> 5 = 4 + 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
Description
The domination number of a graph.
The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
Matching statistic: St000326
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00109: Permutations —descent word⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00104: Binary words —reverse⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => 0 => 2 = 1 + 1
[2,1] => 1 => 1 => 1 = 0 + 1
[1,2,3] => 00 => 00 => 3 = 2 + 1
[1,3,2] => 01 => 10 => 1 = 0 + 1
[2,1,3] => 10 => 01 => 2 = 1 + 1
[2,3,1] => 01 => 10 => 1 = 0 + 1
[3,1,2] => 10 => 01 => 2 = 1 + 1
[3,2,1] => 11 => 11 => 1 = 0 + 1
[1,2,3,4] => 000 => 000 => 4 = 3 + 1
[1,2,4,3] => 001 => 100 => 1 = 0 + 1
[1,3,2,4] => 010 => 010 => 2 = 1 + 1
[1,3,4,2] => 001 => 100 => 1 = 0 + 1
[1,4,2,3] => 010 => 010 => 2 = 1 + 1
[1,4,3,2] => 011 => 110 => 1 = 0 + 1
[2,1,3,4] => 100 => 001 => 3 = 2 + 1
[2,1,4,3] => 101 => 101 => 1 = 0 + 1
[2,3,1,4] => 010 => 010 => 2 = 1 + 1
[2,3,4,1] => 001 => 100 => 1 = 0 + 1
[2,4,1,3] => 010 => 010 => 2 = 1 + 1
[2,4,3,1] => 011 => 110 => 1 = 0 + 1
[3,1,2,4] => 100 => 001 => 3 = 2 + 1
[3,1,4,2] => 101 => 101 => 1 = 0 + 1
[3,2,1,4] => 110 => 011 => 2 = 1 + 1
[3,2,4,1] => 101 => 101 => 1 = 0 + 1
[3,4,1,2] => 010 => 010 => 2 = 1 + 1
[3,4,2,1] => 011 => 110 => 1 = 0 + 1
[4,1,2,3] => 100 => 001 => 3 = 2 + 1
[4,1,3,2] => 101 => 101 => 1 = 0 + 1
[4,2,1,3] => 110 => 011 => 2 = 1 + 1
[4,2,3,1] => 101 => 101 => 1 = 0 + 1
[4,3,1,2] => 110 => 011 => 2 = 1 + 1
[4,3,2,1] => 111 => 111 => 1 = 0 + 1
[1,2,3,4,5] => 0000 => 0000 => 5 = 4 + 1
[1,2,3,5,4] => 0001 => 1000 => 1 = 0 + 1
[1,2,4,3,5] => 0010 => 0100 => 2 = 1 + 1
[1,2,4,5,3] => 0001 => 1000 => 1 = 0 + 1
[1,2,5,3,4] => 0010 => 0100 => 2 = 1 + 1
[1,2,5,4,3] => 0011 => 1100 => 1 = 0 + 1
[1,3,2,4,5] => 0100 => 0010 => 3 = 2 + 1
[1,3,2,5,4] => 0101 => 1010 => 1 = 0 + 1
[1,3,4,2,5] => 0010 => 0100 => 2 = 1 + 1
[1,3,4,5,2] => 0001 => 1000 => 1 = 0 + 1
[1,3,5,2,4] => 0010 => 0100 => 2 = 1 + 1
[1,3,5,4,2] => 0011 => 1100 => 1 = 0 + 1
[1,4,2,3,5] => 0100 => 0010 => 3 = 2 + 1
[1,4,2,5,3] => 0101 => 1010 => 1 = 0 + 1
[1,4,3,2,5] => 0110 => 0110 => 2 = 1 + 1
[1,4,3,5,2] => 0101 => 1010 => 1 = 0 + 1
[1,4,5,2,3] => 0010 => 0100 => 2 = 1 + 1
[1,4,5,3,2] => 0011 => 1100 => 1 = 0 + 1
Description
The position of the first one in a binary word after appending a 1 at the end.
Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
Matching statistic: St000382
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => [2] => 2 = 1 + 1
[2,1] => [1,1] => [1,1] => 1 = 0 + 1
[1,2,3] => [3] => [3] => 3 = 2 + 1
[1,3,2] => [2,1] => [1,2] => 1 = 0 + 1
[2,1,3] => [1,2] => [2,1] => 2 = 1 + 1
[2,3,1] => [2,1] => [1,2] => 1 = 0 + 1
[3,1,2] => [1,2] => [2,1] => 2 = 1 + 1
[3,2,1] => [1,1,1] => [1,1,1] => 1 = 0 + 1
[1,2,3,4] => [4] => [4] => 4 = 3 + 1
[1,2,4,3] => [3,1] => [1,3] => 1 = 0 + 1
[1,3,2,4] => [2,2] => [2,2] => 2 = 1 + 1
[1,3,4,2] => [3,1] => [1,3] => 1 = 0 + 1
[1,4,2,3] => [2,2] => [2,2] => 2 = 1 + 1
[1,4,3,2] => [2,1,1] => [1,1,2] => 1 = 0 + 1
[2,1,3,4] => [1,3] => [3,1] => 3 = 2 + 1
[2,1,4,3] => [1,2,1] => [1,2,1] => 1 = 0 + 1
[2,3,1,4] => [2,2] => [2,2] => 2 = 1 + 1
[2,3,4,1] => [3,1] => [1,3] => 1 = 0 + 1
[2,4,1,3] => [2,2] => [2,2] => 2 = 1 + 1
[2,4,3,1] => [2,1,1] => [1,1,2] => 1 = 0 + 1
[3,1,2,4] => [1,3] => [3,1] => 3 = 2 + 1
[3,1,4,2] => [1,2,1] => [1,2,1] => 1 = 0 + 1
[3,2,1,4] => [1,1,2] => [2,1,1] => 2 = 1 + 1
[3,2,4,1] => [1,2,1] => [1,2,1] => 1 = 0 + 1
[3,4,1,2] => [2,2] => [2,2] => 2 = 1 + 1
[3,4,2,1] => [2,1,1] => [1,1,2] => 1 = 0 + 1
[4,1,2,3] => [1,3] => [3,1] => 3 = 2 + 1
[4,1,3,2] => [1,2,1] => [1,2,1] => 1 = 0 + 1
[4,2,1,3] => [1,1,2] => [2,1,1] => 2 = 1 + 1
[4,2,3,1] => [1,2,1] => [1,2,1] => 1 = 0 + 1
[4,3,1,2] => [1,1,2] => [2,1,1] => 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => [1,1,1,1] => 1 = 0 + 1
[1,2,3,4,5] => [5] => [5] => 5 = 4 + 1
[1,2,3,5,4] => [4,1] => [1,4] => 1 = 0 + 1
[1,2,4,3,5] => [3,2] => [2,3] => 2 = 1 + 1
[1,2,4,5,3] => [4,1] => [1,4] => 1 = 0 + 1
[1,2,5,3,4] => [3,2] => [2,3] => 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => [1,1,3] => 1 = 0 + 1
[1,3,2,4,5] => [2,3] => [3,2] => 3 = 2 + 1
[1,3,2,5,4] => [2,2,1] => [1,2,2] => 1 = 0 + 1
[1,3,4,2,5] => [3,2] => [2,3] => 2 = 1 + 1
[1,3,4,5,2] => [4,1] => [1,4] => 1 = 0 + 1
[1,3,5,2,4] => [3,2] => [2,3] => 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => [1,1,3] => 1 = 0 + 1
[1,4,2,3,5] => [2,3] => [3,2] => 3 = 2 + 1
[1,4,2,5,3] => [2,2,1] => [1,2,2] => 1 = 0 + 1
[1,4,3,2,5] => [2,1,2] => [2,1,2] => 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => [1,2,2] => 1 = 0 + 1
[1,4,5,2,3] => [3,2] => [2,3] => 2 = 1 + 1
[1,4,5,3,2] => [3,1,1] => [1,1,3] => 1 = 0 + 1
Description
The first part of an integer composition.
Matching statistic: St000544
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000544: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000544: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => ([],2)
=> 2 = 1 + 1
[2,1] => [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,2,3] => [3] => ([],3)
=> 3 = 2 + 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[1,2,3,4] => [4] => ([],4)
=> 4 = 3 + 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,2,3,4,5] => [5] => ([],5)
=> 5 = 4 + 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
Description
The cop number of a graph.
This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
Matching statistic: St000678
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00062: Permutations —Lehmer-code to major-code bijection⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [1,2] => [1,0,1,0]
=> 2 = 1 + 1
[2,1] => [2,1] => [1,1,0,0]
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,3,2] => [3,1,2] => [1,1,1,0,0,0]
=> 1 = 0 + 1
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2 = 1 + 1
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> 1 = 0 + 1
[3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> 2 = 1 + 1
[3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,2,4,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,3,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,4,3,2] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[2,1,4,3] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[2,3,1,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[2,3,4,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[2,4,1,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,1,4,2] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[3,2,4,1] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[3,4,1,2] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[3,4,2,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[4,1,3,2] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[4,2,1,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[4,2,3,1] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[4,3,1,2] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,2,3,5,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,2,4,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,2,4,5,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,3,2,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,3,2,5,4] => [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,3,4,2,5] => [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,5,2] => [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,3,5,2,4] => [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,3,5,4,2] => [5,2,4,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,4,3,2,5] => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,4,3,5,2] => [3,2,5,1,4] => [1,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,4,5,3,2] => [2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
Description
The number of up steps after the last double rise of a Dyck path.
Matching statistic: St000745
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [[1],[2]]
=> 2 = 1 + 1
[2,1] => [1,2] => [[1,2]]
=> 1 = 0 + 1
[1,2,3] => [3,2,1] => [[1],[2],[3]]
=> 3 = 2 + 1
[1,3,2] => [2,3,1] => [[1,2],[3]]
=> 1 = 0 + 1
[2,1,3] => [3,1,2] => [[1,3],[2]]
=> 2 = 1 + 1
[2,3,1] => [1,3,2] => [[1,2],[3]]
=> 1 = 0 + 1
[3,1,2] => [2,1,3] => [[1,3],[2]]
=> 2 = 1 + 1
[3,2,1] => [1,2,3] => [[1,2,3]]
=> 1 = 0 + 1
[1,2,3,4] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 4 = 3 + 1
[1,2,4,3] => [3,4,2,1] => [[1,2],[3],[4]]
=> 1 = 0 + 1
[1,3,2,4] => [4,2,3,1] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[1,3,4,2] => [2,4,3,1] => [[1,2],[3],[4]]
=> 1 = 0 + 1
[1,4,2,3] => [3,2,4,1] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[1,4,3,2] => [2,3,4,1] => [[1,2,3],[4]]
=> 1 = 0 + 1
[2,1,3,4] => [4,3,1,2] => [[1,4],[2],[3]]
=> 3 = 2 + 1
[2,1,4,3] => [3,4,1,2] => [[1,2],[3,4]]
=> 1 = 0 + 1
[2,3,1,4] => [4,1,3,2] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[2,3,4,1] => [1,4,3,2] => [[1,2],[3],[4]]
=> 1 = 0 + 1
[2,4,1,3] => [3,1,4,2] => [[1,3],[2,4]]
=> 2 = 1 + 1
[2,4,3,1] => [1,3,4,2] => [[1,2,3],[4]]
=> 1 = 0 + 1
[3,1,2,4] => [4,2,1,3] => [[1,4],[2],[3]]
=> 3 = 2 + 1
[3,1,4,2] => [2,4,1,3] => [[1,2],[3,4]]
=> 1 = 0 + 1
[3,2,1,4] => [4,1,2,3] => [[1,3,4],[2]]
=> 2 = 1 + 1
[3,2,4,1] => [1,4,2,3] => [[1,2,4],[3]]
=> 1 = 0 + 1
[3,4,1,2] => [2,1,4,3] => [[1,3],[2,4]]
=> 2 = 1 + 1
[3,4,2,1] => [1,2,4,3] => [[1,2,3],[4]]
=> 1 = 0 + 1
[4,1,2,3] => [3,2,1,4] => [[1,4],[2],[3]]
=> 3 = 2 + 1
[4,1,3,2] => [2,3,1,4] => [[1,2,4],[3]]
=> 1 = 0 + 1
[4,2,1,3] => [3,1,2,4] => [[1,3,4],[2]]
=> 2 = 1 + 1
[4,2,3,1] => [1,3,2,4] => [[1,2,4],[3]]
=> 1 = 0 + 1
[4,3,1,2] => [2,1,3,4] => [[1,3,4],[2]]
=> 2 = 1 + 1
[4,3,2,1] => [1,2,3,4] => [[1,2,3,4]]
=> 1 = 0 + 1
[1,2,3,4,5] => [5,4,3,2,1] => [[1],[2],[3],[4],[5]]
=> 5 = 4 + 1
[1,2,3,5,4] => [4,5,3,2,1] => [[1,2],[3],[4],[5]]
=> 1 = 0 + 1
[1,2,4,3,5] => [5,3,4,2,1] => [[1,3],[2],[4],[5]]
=> 2 = 1 + 1
[1,2,4,5,3] => [3,5,4,2,1] => [[1,2],[3],[4],[5]]
=> 1 = 0 + 1
[1,2,5,3,4] => [4,3,5,2,1] => [[1,3],[2],[4],[5]]
=> 2 = 1 + 1
[1,2,5,4,3] => [3,4,5,2,1] => [[1,2,3],[4],[5]]
=> 1 = 0 + 1
[1,3,2,4,5] => [5,4,2,3,1] => [[1,4],[2],[3],[5]]
=> 3 = 2 + 1
[1,3,2,5,4] => [4,5,2,3,1] => [[1,2],[3,4],[5]]
=> 1 = 0 + 1
[1,3,4,2,5] => [5,2,4,3,1] => [[1,3],[2],[4],[5]]
=> 2 = 1 + 1
[1,3,4,5,2] => [2,5,4,3,1] => [[1,2],[3],[4],[5]]
=> 1 = 0 + 1
[1,3,5,2,4] => [4,2,5,3,1] => [[1,3],[2,4],[5]]
=> 2 = 1 + 1
[1,3,5,4,2] => [2,4,5,3,1] => [[1,2,3],[4],[5]]
=> 1 = 0 + 1
[1,4,2,3,5] => [5,3,2,4,1] => [[1,4],[2],[3],[5]]
=> 3 = 2 + 1
[1,4,2,5,3] => [3,5,2,4,1] => [[1,2],[3,4],[5]]
=> 1 = 0 + 1
[1,4,3,2,5] => [5,2,3,4,1] => [[1,3,4],[2],[5]]
=> 2 = 1 + 1
[1,4,3,5,2] => [2,5,3,4,1] => [[1,2,4],[3],[5]]
=> 1 = 0 + 1
[1,4,5,2,3] => [3,2,5,4,1] => [[1,3],[2,4],[5]]
=> 2 = 1 + 1
[1,4,5,3,2] => [2,3,5,4,1] => [[1,2,3],[4],[5]]
=> 1 = 0 + 1
Description
The index of the last row whose first entry is the row number in a standard Young tableau.
Matching statistic: St000916
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000916: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000916: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => ([],2)
=> 2 = 1 + 1
[2,1] => [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,2,3] => [3] => ([],3)
=> 3 = 2 + 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1 = 0 + 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[1,2,3,4] => [4] => ([],4)
=> 4 = 3 + 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,2,3,4,5] => [5] => ([],5)
=> 5 = 4 + 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
Description
The packing number of a graph.
This is the size of a largest subset of vertices of a graph, such that any two distinct vertices in the subset have disjoint closed neighbourhoods, or, equivalently, have distance greater than two.
The following 62 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001829The common independence number of a graph. St001176The size of a partition minus its first part. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000093The cardinality of a maximal independent set of vertices of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000917The open packing number of a graph. St001050The number of terminal closers of a set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001463The number of distinct columns in the nullspace of a graph. St001672The restrained domination number of a graph. St001691The number of kings in a graph. St001733The number of weak left to right maxima of a Dyck path. St000439The position of the first down step of a Dyck path. St000287The number of connected components of a graph. St000553The number of blocks of a graph. St000363The number of minimal vertex covers of a graph. St000759The smallest missing part in an integer partition. St001316The domatic number of a graph. St001828The Euler characteristic of a graph. St000993The multiplicity of the largest part of an integer partition. St000234The number of global ascents of a permutation. St000617The number of global maxima of a Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000542The number of left-to-right-minima of a permutation. St000654The first descent of a permutation. St000990The first ascent of a permutation. St000007The number of saliances of the permutation. St000054The first entry of the permutation. St000546The number of global descents of a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St000090The variation of a composition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St000056The decomposition (or block) number of a permutation. St000286The number of connected components of the complement of a graph. St000314The number of left-to-right-maxima of a permutation. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001481The minimal height of a peak of a Dyck path. St000258The burning number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000456The monochromatic index of a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001904The length of the initial strictly increasing segment of a parking function. St000942The number of critical left to right maxima of the parking functions. St001937The size of the center of a parking function.
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!