Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001345
(load all 2 compositions to match this statistic)
Mapping
St001345: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 0
([],2)
 => 1
([(0,1)],2)
 => 1
([],3)
 => 2
([(1,2)],3)
 => 3
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 2
([],4)
 => 2
([(2,3)],4)
 => 4
([(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)
 => 4
([(0,3),(1,2),(1,3),(2,3)],4)
 => 4
([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(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)
 => 3
([(3,4)],5)
 => 4
([(2,4),(3,4)],5)
 => 4
([(1,4),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,4),(3,4)],5)
 => 4
([(1,4),(2,3)],5)
 => 4
([(1,4),(2,3),(3,4)],5)
 => 4
([(0,1),(2,4),(3,4)],5)
 => 4
([(2,3),(2,4),(3,4)],5)
 => 5
([(0,4),(1,4),(2,3),(3,4)],5)
 => 4
([(1,4),(2,3),(2,4),(3,4)],5)
 => 5
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 6
([(1,3),(1,4),(2,3),(2,4)],5)
 => 4
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 5
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 6
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 6
([(0,4),(1,3),(2,3),(2,4)],5)
 => 3
([(0,1),(2,3),(2,4),(3,4)],5)
 => 5
([(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)
 => 5
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 4
([(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)
 => 4
([(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),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 5
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 3
Description
The Hamming dimension of a graph. Let $H(n, k)$ be the graph whose vertices are the subsets of $\{1,\dots,n\}$, and $(u,v)$ being an edge, for $u\neq v$, if the symmetric difference of $u$ and $v$ has cardinality at most $k$. This statistic is the smallest $n$ such that the graph is an induced subgraph of $H(n, k)$ for some $k$.