Identifier
Values
[1] => ([],1) => ([],1) => 0
[1,2] => ([(0,1)],2) => ([],2) => 0
[2,1] => ([(0,1)],2) => ([],2) => 0
[1,2,3] => ([(0,2),(2,1)],3) => ([],3) => 0
[1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 1
[2,1,3] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 1
[2,3,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 1
[3,1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 1
[3,2,1] => ([(0,2),(2,1)],3) => ([],3) => 0
[1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 0
[1,2,4,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[1,3,2,4] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[1,3,4,2] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[1,4,2,3] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[1,4,3,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[2,1,3,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[2,1,4,3] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => 1
[2,3,1,4] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[2,3,4,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[2,4,3,1] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[3,1,2,4] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[3,2,1,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[3,2,4,1] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[3,4,1,2] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => 1
[3,4,2,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[4,1,2,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[4,1,3,2] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[4,2,1,3] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[4,2,3,1] => ([(0,1),(0,2),(0,3),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(6,5)],7) => ([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => 2
[4,3,1,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[4,3,2,1] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 0
[1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 0
[5,4,3,2,1] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 0
[1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 0
[6,5,4,3,2,1] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 0
[1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => 0
[7,6,5,4,3,2,1] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => 0
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 bandwidth of a graph.
The bandwidth of a graph is the smallest number $k$ such that the vertices of the graph can be
ordered as $v_1,\dots,v_n$ with $k \cdot d(v_i,v_j) \geq |i-j|$.
We adopt the convention that the singleton graph has bandwidth $0$, consistent with the bandwith of the complete graph on $n$ vertices having bandwidth $n-1$, but in contrast to any path graph on more than one vertex having bandwidth $1$. The bandwidth of a disconnected graph is the maximum of the bandwidths of the connected components.
The bandwidth of a graph is the smallest number $k$ such that the vertices of the graph can be
ordered as $v_1,\dots,v_n$ with $k \cdot d(v_i,v_j) \geq |i-j|$.
We adopt the convention that the singleton graph has bandwidth $0$, consistent with the bandwith of the complete graph on $n$ vertices having bandwidth $n-1$, but in contrast to any path graph on more than one vertex having bandwidth $1$. The bandwidth of a disconnected graph is the maximum of the bandwidths of the connected components.
Map
pattern poset
Description
The pattern poset of a permutation.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
Map
incomparability graph
Description
The incomparability graph of a poset.
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!