Identifier
Values
0 => ([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => 1
1 => ([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => 1
00 => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => 1
01 => ([(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
10 => ([(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
11 => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => 1
000 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(1,2),(2,3)],4) => 1
001 => ([(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) => 2
010 => ([(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) => 2
011 => ([(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) => 2
100 => ([(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) => 2
101 => ([(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) => 2
110 => ([(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) => 2
111 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(1,2),(2,3)],4) => 1
0000 => ([(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) => 2
1111 => ([(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) => 2
00000 => ([(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) => 3
11111 => ([(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) => 3
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7) => ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 4
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7) => ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 4
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
click to show known generating functions       
Description
The treewidth of a graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
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
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.