Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001798
Mapping
St001798: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 0
([],2)
 => 0
([(0,1)],2)
 => 0
([],3)
 => 0
([(1,2)],3)
 => 0
([(0,2),(1,2)],3)
 => 1
([(0,1),(0,2),(1,2)],3)
 => 0
([],4)
 => 0
([(2,3)],4)
 => 0
([(1,3),(2,3)],4)
 => 1
([(0,3),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2)],4)
 => 0
([(0,3),(1,2),(2,3)],4)
 => 1
([(1,2),(1,3),(2,3)],4)
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(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)
 => 0
([],5)
 => 0
([(3,4)],5)
 => 0
([(2,4),(3,4)],5)
 => 1
([(1,4),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => 3
([(1,4),(2,3)],5)
 => 0
([(1,4),(2,3),(3,4)],5)
 => 1
([(0,1),(2,4),(3,4)],5)
 => 1
([(2,3),(2,4),(3,4)],5)
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(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)
 => 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
([(0,4),(1,3),(2,3),(2,4)],5)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 1
([(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)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(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)
 => 2
([(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)
 => 4
Description
The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. Let $n(G)$ be the number of vertices of a graph $G$, $m(G)$ be its number of edges and let $\alpha(G)$ be its independence number, [[St000093]]. Turán's theorem is that $m(G) \geq m(T^c(n(G), \alpha(G)))$ where $T^c(n, r)$ is the complement of the Turán graph. This statistic records the difference.