Identifier
Values
[1,0] => [2,1] => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 2
[1,0,1,0] => [3,1,2] => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,1,0,0] => [2,3,1] => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,0,1,0,1,0] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,0,1,1,0,0] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 3
[1,1,0,0,1,0] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 3
[1,1,0,1,0,0] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
[1,1,1,0,0,0] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,0,1,0,1,0,1,0] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,0,1,1,0,0] => [4,1,2,5,3] => ([(0,4),(1,4),(2,3),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,0,1,1,1,0,0,0] => [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,0,1,0,1,0] => [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,1,1,0,0,0] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 4
[1,1,1,0,0,0,1,0] => [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,1,0,0,1,0,0] => [2,5,4,1,3] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 4
[1,1,1,1,0,0,0,0] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[] => [1] => ([],1) => ([(0,1)],2) => 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 biclique partition number of a graph.
The biclique partition number of a graph is the minimum number of pairwise edge disjoint complete bipartite subgraphs so that each edge belongs to exactly one of them. A theorem of Graham and Pollak [1] asserts that the complete graph $K_n$ has biclique partition number $n - 1$.
Map
cone
Description
The cone of a graph.
The cone of a graph is obtained by joining a new vertex to all the vertices of the graph. The added vertex is called a universal vertex or a dominating vertex.
Map
graph of inversions
Description
The graph of inversions of a permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.