Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001704
(load all 2 compositions to match this statistic)
Mapping
St001704: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
 => 2
([(0,1)],2)
 => 2
([],3)
 => 2
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 2
([],4)
 => 2
([(2,3)],4)
 => 3
([(1,3),(2,3)],4)
 => 3
([(0,3),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2)],4)
 => 3
([(0,3),(1,2),(2,3)],4)
 => 3
([(1,2),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([],5)
 => 2
([(3,4)],5)
 => 3
([(2,4),(3,4)],5)
 => 4
([(1,4),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3)],5)
 => 3
([(1,4),(2,3),(3,4)],5)
 => 4
([(0,1),(2,4),(3,4)],5)
 => 3
([(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => 4
([(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 4
([(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)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => 3
([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
Description
The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. The deck of a graph is the multiset of induced subgraphs obtained by deleting a single vertex. The graph reconstruction conjecture states that the deck of a graph with at least three vertices determines the graph. This statistic is only defined for graphs with at least two vertices, because there is only a single graph of the given size otherwise.