Processing math: 100%

Identifier
Values
['A',1] => ([],1) => ([],1) => ([],1) => 1
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(1,2)],3) => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(2,3)],4) => 1
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => ([(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) => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
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 Grundy value of the game of creating an independent set in a graph.
Two players alternately add a vertex to an initially empty set, which is not adjacent to any of the vertices it already contains.
Alternatively, the game can be described as starting with a graph, the players remove vertices together with their neighbors, until the graph is empty.
Map
Ore closure
Description
The Ore closure of a graph.
The Ore closure of a connected graph G has the same vertices as G, and the smallest set of edges containing the edges of G such that for any two vertices u and v whose sum of degrees is at least the number of vertices, then (u,v) is also an edge.
For disconnected graphs, we compute the closure separately for each component.
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 α≺β if β−α is a simple root.