Identifier
Values
['A',1] => ([],1) => ([],1) => ([],1) => 0
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(0,2),(1,2)],3) => 1
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
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
incomparability graph
Description
The incomparability graph of a poset.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
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.