Processing math: 100%

Identifier
Values
['A',1] => ([],1) => ([],1) => ([],1) => 1
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(0,2),(1,2)],3) => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
['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) => 5
['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) => 5
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 number of maximally independent sets of vertices of a graph.
An independent set of vertices of a graph is a set of vertices no two of which are adjacent. If a set of vertices is independent then so is every subset. This statistic counts the number of maximally independent sets of vertices.
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 α≺β if β−α 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.
Map
incomparability graph
Description
The incomparability graph of a poset.