Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001057: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 1
([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> 0
([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 1
([(3,4)],5)
=> 0
([(2,4),(3,4)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(1,4),(2,3)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
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.