Identifier
Values
['A',1] => ([],1) => ([],1) => ([],1) => 0
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(0,2),(1,2)],3) => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => ([(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
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => 3
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 minimal number of edges to add or remove to make a graph edge transitive.
A graph is edge transitive, if for any two edges, there is an automorphism that maps one edge to the other.
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.