Processing math: 67%

Your data matches 418 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001309: 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)
=> 0
([(0,1),(0,2),(1,2)],3)
=> 0
([],4)
=> 0
([(2,3)],4)
=> 0
([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> 0
([(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)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 0
([(3,4)],5)
=> 0
([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> 0
([(1,4),(2,3),(3,4)],5)
=> 0
([(0,1),(2,4),(3,4)],5)
=> 0
([(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(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)
=> 0
([(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)
=> 0
([(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)
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(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)
=> 0
Description
The number of four-cliques in a graph.
St001334: 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)
=> 0
([(0,1),(0,2),(1,2)],3)
=> 0
([],4)
=> 0
([(2,3)],4)
=> 0
([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> 0
([(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)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 0
([(3,4)],5)
=> 0
([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> 0
([(1,4),(2,3),(3,4)],5)
=> 0
([(0,1),(2,4),(3,4)],5)
=> 0
([(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(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)
=> 0
([(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)
=> 0
([(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)
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(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)
=> 0
Description
The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. A graph is 3-colourable if and only if in any linear ordering of its vertices, there are no four vertices a<b<c<d such that (a,b),(b,c) and (c,d) are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Mp00318: Graphs dual on componentsGraphs
Mp00247: Graphs de-duplicateGraphs
St001329: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],1)
=> 0
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 0
([],3)
=> ([],3)
=> ([],1)
=> 0
([(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([],4)
=> ([],4)
=> ([],1)
=> 0
([(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 0
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> ([],5)
=> ([],1)
=> 0
([(3,4)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 0
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 0
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(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,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
Description
The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. A graph is outerplanar if and only if in any linear ordering of its vertices, there are no four vertices a<b<c<d such that (a,c) and (b,d) are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Mp00274: Graphs block-cut treeGraphs
St001578: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(1,4),(2,3)],5)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 0
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 5
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
Description
The minimal number of edges to add or remove to make a graph a line graph.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St000095: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 5
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The number of triangles of a graph. A triangle T of a graph G is a collection of three vertices {u,v,w}G such that they form K3, the complete graph on three vertices.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St001305: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 5
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The number of induced cycles on four vertices in a graph.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St001328: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 5
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. A graph is bipartite if and only if in any linear ordering of its vertices, there are no three vertices a<b<c such that (a,b) and (b,c) are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St001331: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 5
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The size of the minimal feedback vertex set. A feedback vertex set is a set of vertices whose removal results in an acyclic graph.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St001336: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 5
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The minimal number of vertices in a graph whose complement is triangle-free.
Mp00274: Graphs block-cut treeGraphs
Mp00157: Graphs connected complementGraphs
St001572: Graphs ⟶ ℤResult quality: 75% values known / values provided: 98%distinct values known / distinct values provided: 75%
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> ([],2)
=> 0
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 5
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
Description
The minimal number of edges to remove to make a graph bipartite.
The following 408 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001573The minimal number of edges to remove to make a graph triangle-free. St001272The number of graphs with the same degree sequence. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001638The book thickness of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000482The (zero)-forcing number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000948The chromatic discriminant of a graph. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001577The minimal number of edges to add or remove to make a graph a cograph. St001271The competition number of a graph. St000024The number of double up and double down steps of a Dyck path. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St000377The dinv defect of an integer partition. St001703The villainy of a graph. St000012The area of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000447The number of pairs of vertices of a graph with distance 3. St000682The Grundy value of Welter's game on a binary word. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001413Half the length of the longest even length palindromic prefix of a binary word. St001695The natural comajor index of a standard Young tableau. St001697The shifted natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001846The number of elements which do not have a complement in the lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001881The number of factors of a lattice as a Cartesian product of lattices. St000016The number of attacking pairs of a standard tableau. St000877The depth of the binary word interpreted as a path. St001172The number of 1-rises at odd height of a Dyck path. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001584The area statistic between a Dyck path and its bounce path. St001730The number of times the path corresponding to a binary word crosses the base line. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001198The number of simple modules in the algebra eAe with projective dimension at most 1 in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001206The maximal dimension of an indecomposable projective eAe-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St000552The number of cut vertices of a graph. St000553The number of blocks of a graph. St000386The number of factors DDU in a Dyck path. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000449The number of pairs of vertices of a graph with distance 4. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001793The difference between the clique number and the chromatic number of a graph. St000091The descent variation of a composition. St000403The Szeged index minus the Wiener index of a graph. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000687The dimension of Hom(I,P) for the LNakayama algebra of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000761The number of ascents in an integer composition. St000768The number of peaks in an integer composition. St000807The sum of the heights of the valleys of the associated bargraph. St000934The 2-degree of an integer partition. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001307The number of induced stars on four vertices in a graph. St001310The number of induced diamond graphs in a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001596The number of two-by-two squares inside a skew partition. St001689The number of celebrities in a graph. St001797The number of overfull subgraphs of a graph. St000053The number of valleys of the Dyck path. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000637The length of the longest cycle in a graph. St000661The number of rises of length 3 of a Dyck path. St000671The maximin edge-connectivity for choosing a subgraph. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001161The major index north count of a Dyck path. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001306The number of induced paths on four vertices in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001736The total number of cycles in a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001910The height of the middle non-run of a Dyck path. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St000693The modular (standard) major index of a standard tableau. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000442The maximal area to the right of an up step of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000984The number of boxes below precisely one peak. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St000478Another weight of a partition according to Alladi. St000874The position of the last double rise in a Dyck path. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000946The sum of the skew hook positions in a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St000322The skewness of a graph. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St001323The independence gap of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by 4. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000379The number of Hamiltonian cycles in a graph. St000448The number of pairs of vertices of a graph with distance 2. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001193The dimension of Ext1A(A/AeA,A) in the corresponding Nakayama algebra A such that eA is a minimal faithful projective-injective module. St001194The injective dimension of A/AfA in the corresponding Nakayama algebra A when Af is the minimal faithful projective-injective left A-module St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001308The number of induced paths on three vertices in a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001692The number of vertices with higher degree than the average degree in a graph. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001871The number of triconnected components of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between eiJ and ejJ (the radical of the indecomposable projective modules). St001964The interval resolution global dimension of a poset. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000120The number of left tunnels of a Dyck path. St000171The degree of the graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000274The number of perfect matchings of a graph. St000310The minimal degree of a vertex of a graph. St000311The number of vertices of odd degree in a graph. St000331The number of upper interactions of a Dyck path. St000351The determinant of the adjacency matrix of a graph. St000387The matching number of a graph. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000454The largest eigenvalue of a graph if it is integral. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000674The number of hills of a Dyck path. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000932The number of occurrences of the pattern UDU in a Dyck path. St000947The major index east count of a Dyck path. St000954Number of times the corresponding LNakayama algebra has Exti(D(A),A)=0 for i>0. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001071The beta invariant of the graph. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001188The number of simple modules S with grade inf at least two in the Nakayama algebra A corresponding to the Dyck path. St001192The maximal dimension of Ext_A^2(S,A) for a simple module S over the corresponding Nakayama algebra A. St001205The number of non-simple indecomposable projective-injective modules of the algebra eAe in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001274The number of indecomposable injective modules with projective dimension equal to two. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by \tau \Omega^1 composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001333The cardinality of a minimal edge-isolating set of a graph. St001341The number of edges in the center of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001479The number of bridges of a graph. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001743The discrepancy of a graph. St001783The number of odd automorphisms of a graph. St001792The arboricity of a graph. St001826The maximal number of leaves on a vertex of a graph. St001961The sum of the greatest common divisors of all pairs of parts. St001962The proper pathwidth of a graph. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000287The number of connected components of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001765The number of connected components of the friends and strangers graph. St000567The sum of the products of all pairs of parts. St000929The constant term of the character polynomial of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001498The normalised height of a Nakayama algebra with magnitude 1. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001568The smallest positive integer that does not appear twice in the partition. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c_0,c_1,...,c_{n−1}] such that n=c_0 < c_i for all i > 0 a special CNakayama algebra. St001570The minimal number of edges to add to make a graph Hamiltonian. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000117The number of centered tunnels of a Dyck path. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001651The Frankl number of a lattice. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St000069The number of maximal elements of a poset. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001330The hat guessing number of a graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000881The number of short braid edges in the graph of braid moves of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St001645The pebbling number of a connected graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000407The number of occurrences of the pattern 2143 in a permutation. St000944The 3-degree of an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001280The number of parts of an integer partition that are at least two. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001525The number of symmetric hooks on the diagonal of a partition. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001856The number of edges in the reduced word graph of a permutation. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000570The Edelman-Greene number of a permutation. St001208The number of connected components of the quiver of A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra A of K[x]/(x^n). St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001481The minimal height of a peak of a Dyck path. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001845The number of join irreducibles minus the rank of a lattice. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001541The Gini index of an integer partition. St000068The number of minimal elements in a poset. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001248Sum of the even parts of a partition. St000699The toughness times the least common multiple of 1,. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000017The number of inversions of a standard tableau. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000290The major index of a binary word. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000296The length of the symmetric border of a binary word. St000347The inversion sum of a binary word. St000348The non-inversion sum of a binary word. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000547The number of even non-empty partial sums of an integer partition. St000628The balance of a binary word. St000629The defect of a binary word. St000691The number of changes of a binary word. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions of a binary word. St000995The largest even part of an integer partition. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001214The aft of an integer partition. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001371The length of the longest Yamanouchi prefix of a binary word. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001423The number of distinct cubes in a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001524The degree of symmetry of a binary word. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001721The degree of a binary word. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000916The packing number of a graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001301The first Betti number of the order complex associated with the poset. St000181The number of connected components of the Hasse diagram for the poset. St000908The length of the shortest maximal antichain in a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000145The Dyson rank of a partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000941The number of characters of the symmetric group whose value on the partition is even. St001095The number of non-isomorphic posets with precisely one further covering relation. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001279The sum of the parts of an integer partition that are at least two. St001722The number of minimal chains with small intervals between a binary word and the top element. St000782The indicator function of whether a given perfect matching is an L & P matching.