Identifier
Values
0 => ([(0,1)],2) => ([],2) => ([(0,1)],2) => 0
1 => ([(0,1)],2) => ([],2) => ([(0,1)],2) => 0
00 => ([(0,2),(2,1)],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => 0
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
11 => ([(0,2),(2,1)],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => 0
000 => ([(0,3),(2,1),(3,2)],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
111 => ([(0,3),(2,1),(3,2)],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
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 genus of a graph.
This is the smallest genus of an oriented surface on which the graph can be embedded without crossings. One can indeed compute the genus as the sum of the genuses for the connected components.
This is the smallest genus of an oriented surface on which the graph can be embedded without crossings. One can indeed compute the genus as the sum of the genuses for the connected components.
Map
complement
Description
The complement of a graph.
The complement of a graph has the same vertices, but exactly those edges that are not in the original graph.
The complement of a graph has the same vertices, but exactly those edges that are not in the original graph.
Map
incomparability graph
Description
The incomparability graph of a poset.
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$.
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$.
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!