Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001391
Mapping
St001391: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 0
([],2)
 => 2
([(0,1)],2)
 => 1
([],3)
 => 3
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 2
([],4)
 => 3
([(2,3)],4)
 => 3
([(1,3),(2,3)],4)
 => 3
([(0,3),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2)],4)
 => 4
([(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)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => 4
([(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)
 => 3
([],5)
 => 4
([(3,4)],5)
 => 3
([(2,4),(3,4)],5)
 => 3
([(1,4),(2,4),(3,4)],5)
 => 4
([(0,4),(1,4),(2,4),(3,4)],5)
 => 3
([(1,4),(2,3)],5)
 => 4
([(1,4),(2,3),(3,4)],5)
 => 3
([(0,1),(2,4),(3,4)],5)
 => 5
([(2,3),(2,4),(3,4)],5)
 => 4
([(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)
 => 4
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(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)
 => 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,3),(2,3),(2,4)],5)
 => 4
([(0,1),(2,3),(2,4),(3,4)],5)
 => 6
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 5
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 5
([(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)
 => 3
([(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)
 => 3
([(0,3),(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)],5)
 => 4
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 4
Description
The disjunction number of a graph. Let $V_n$ be the power set of $\{1,\dots,n\}$ and let $E_n=\{(a,b)| a,b\in V_n, a\neq b, a\cap b=\emptyset\}$. Then the disjunction number of a graph $G$ is the smallest integer $n$ such that $(V_n, E_n)$ has an induced subgraph isomorphic to $G$.