Identifier
Values
[1] => ([],1) => ([],1) => ([],1) => 1
[1,2] => ([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => 1
[2,1] => ([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => 1
[1,2,3] => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => 1
[1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 2
[2,1,3] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 2
[2,3,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 2
[3,1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 2
[3,2,1] => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => 1
[1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(1,2),(2,3)],4) => 1
[1,2,4,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[1,4,3,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[2,1,3,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[2,1,4,3] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6) => 3
[2,3,4,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[3,2,1,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[3,4,1,2] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6) => 3
[3,4,2,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[4,1,2,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[4,3,1,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6) => 4
[4,3,2,1] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(1,2),(2,3)],4) => 1
[1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 3
[5,4,3,2,1] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 3
[1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[6,5,4,3,2,1] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
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 edges minus the number of vertices plus 2 of a graph.
When G is connected and planar, this is also the number of its faces.
When $G=(V,E)$ is a connected graph, this is its $k$-monochromatic index for $k>2$: for $2\leq k\leq |V|$, the $k$-monochromatic index of $G$ is the maximum number of edge colors allowed such that for each set $S$ of $k$ vertices, there exists a monochromatic tree in $G$ which contains all vertices from $S$. It is shown in [1] that for $k>2$, this is given by this statistic.
Map
connected complement
Description
The componentwise connected complement of a graph.
For a connected graph $G$, this map returns the complement of $G$ if it is connected, otherwise $G$ itself. If $G$ is not connected, the map is applied to each connected component separately.
Map
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
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.