searching the database
Your data matches 486 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001776
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([],2)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(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)
=> ([],4)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(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)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(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)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2)],4)
=> ([(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)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(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,4),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 1
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],6)
=> 1
Description
The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph.
Matching statistic: St001496
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1
([],2)
=> ([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 1
([],3)
=> ([],3)
=> ([],3)
=> 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 1
([],4)
=> ([],4)
=> ([],4)
=> 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 1
([(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)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 1
([],5)
=> ([],5)
=> ([],5)
=> 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(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)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 1
([(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)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 1
([(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)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
([(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)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 1
([(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)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(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)
=> ? = 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 1
([(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)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 1
([(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)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ? = 2
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ? = 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ? = 1
([],0)
=> ?
=> ?
=> ? = 1
Description
The number of graphs with the same Laplacian spectrum as the given graph.
Matching statistic: St001325
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> 0 = 1 - 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 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> 0 = 1 - 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 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ? = 1 - 1
Description
The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph.
A graph is a comparability graph 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 and $(a,c)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001305
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(1,3),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 1 - 1
Description
The number of induced cycles on four vertices in a graph.
Matching statistic: St001306
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(1,3),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 1 - 1
Description
The number of induced paths on four vertices in a graph.
Matching statistic: St001310
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(1,3),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 1 - 1
Description
The number of induced diamond graphs in a graph.
A diamond graph is a cycle on four vertices, with an additional edge connecting two of the non-adjacent vertices.
Matching statistic: St001324
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(1,3),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 1 - 1
Description
The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph.
A graph is chordal if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,c)$ and $(b,c)$ are edges and $(a,b)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001326
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> ([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> ([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(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,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> ([],3)
=> ([],3)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(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,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> ([],2)
=> ([],2)
=> 0 = 1 - 1
([(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,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(1,3),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ([(0,2),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(0,2),(0,3),(0,4),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,5),(3,6),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ([(0,1),(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ([(1,2),(1,4),(1,5),(1,7),(2,3),(2,5),(2,6),(3,4),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ([(0,3),(0,4),(0,6),(0,7),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(4,5),(4,7),(5,6),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ([(0,1),(0,3),(0,4),(0,5),(0,6),(0,8),(1,2),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,6),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,7),(4,8),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(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)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 1 - 1
Description
The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph.
A graph is an interval graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,c)$ is an edge and $(a,b)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St000095
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> ([(2,6),(3,5),(4,5),(4,6)],7)
=> ? = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ? = 1 - 1
Description
The number of triangles of a graph.
A triangle $T$ of a graph $G$ is a collection of three vertices $\{u,v,w\} \in G$ such that they form $K_3$, the complete graph on three vertices.
Matching statistic: St000274
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0 = 1 - 1
([],2)
=> ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> ([],1)
=> 0 = 1 - 1
([],3)
=> ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> ([],2)
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0 = 1 - 1
([],4)
=> ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> ([],3)
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0 = 1 - 1
([],5)
=> ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> ([],4)
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> ([],3)
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> ([(2,6),(3,5),(4,5),(4,6)],7)
=> ? = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> ? = 1 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,6),(1,7),(2,7),(3,4),(3,5),(4,6),(5,7)],8)
=> ? = 1 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,6),(1,6),(2,5),(3,5),(4,5),(4,6)],7)
=> ? = 2 - 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> ([(1,7),(2,6),(3,4),(3,5),(4,6),(5,7)],8)
=> ? = 1 - 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,7),(3,5),(3,7),(4,6),(4,7)],8)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> ? = 2 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,8),(1,7),(2,3),(2,4),(3,5),(4,6),(5,7),(6,8)],9)
=> ? = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ? = 1 - 1
([],0)
=> ?
=> ? = 1 - 1
Description
The number of perfect matchings of a graph.
A matching of a graph $G$ is a subset $F \subset E(G)$ such that no two edges in $F$ share a vertex in common. A perfect matching $F'$ is then a matching such that every vertex in $V(G)$ is incident with exactly one edge in $F'$.
The following 476 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. 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. St001783The number of odd automorphisms of a graph. St001871The number of triconnected components of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000096The number of spanning trees of a graph. St000260The radius of a connected graph. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000271The chromatic index of a graph. St000273The domination number of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000287The number of connected components of a graph. St000349The number of different adjacency matrices of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in 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. St000775The multiplicity of the largest eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000916The packing number of a graph. St000948The chromatic discriminant of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001271The competition number of a graph. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001286The annihilation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001363The Euler characteristic of a graph according to Knill. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001386The number of prime labellings of a graph. St001395The number of strictly unfriendly partitions of a graph. St001463The number of distinct columns in the nullspace of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001518The number of graphs with the same ordinary spectrum as the given graph. St001546The number of monomials in the Tutte polynomial of a graph. St001642The Prague dimension of a graph. St001694The number of maximal dissociation sets in a graph. St001716The 1-improper chromatic number of a graph. St001734The lettericity of a graph. 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. St001765The number of connected components of the friends and strangers graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000258The burning number of a graph. St000313The number of degree 2 vertices of a graph. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000448The number of pairs of vertices of a graph with distance 2. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St000637The length of the longest cycle in a graph. St000671The maximin edge-connectivity for choosing a subgraph. St000918The 2-limited packing number of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001307The number of induced stars on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001309The number of four-cliques 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. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. 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. St001367The smallest number which does not occur as degree of a vertex in a graph. St001374The Padmakar-Ivan index of a graph. 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. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001638The book thickness of a graph. 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. St001648The number of edges that can be added without increasing the chromatic number. St001689The number of celebrities in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001703The villainy of a graph. St001708The number of pairs of vertices of different degree in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001742The difference of the maximal and the minimal degree in a graph. St001764The number of non-convex subsets of vertices in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001797The number of overfull subgraphs of 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. St001799The number of proper separations of a graph. St000086The number of subgraphs. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000268The number of strongly connected orientations of a graph. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000286The number of connected components of the complement of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000343The number of spanning subgraphs of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000363The number of minimal vertex covers of a graph. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000468The Hosoya index of a graph. St000722The number of different neighbourhoods in a graph. St000822The Hadwiger number of the graph. St000972The composition number of a graph. St001029The size of the core of a graph. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3. St001073The number of nowhere zero 3-flows of a graph. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001303The number of dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001725The harmonious chromatic number of a graph. St001758The number of orbits of promotion on a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000081The number of edges of a graph. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000311The number of vertices of odd degree in a graph. St000312The number of leaves in a graph. St000350The sum of the vertex degrees of a graph. St000351The determinant of the adjacency matrix of a graph. St000361The second Zagreb index of a graph. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000422The energy of a graph, if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000465The first Zagreb index of a graph. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000571The F-index (or forgotten topological index) of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000915The Ore degree of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001071The beta invariant of the graph. St001117The game chromatic index of a graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001270The bandwidth of a graph. St001277The degeneracy 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. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001362The normalized Knill dimension of a graph. St001393The induced matching number of a graph. 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. St001512The minimum rank of a graph. St001644The dimension of a graph. St001649The length of a longest trail in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001743The discrepancy of a graph. St001792The arboricity of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001812The biclique partition number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001869The maximum cut size of a graph. St001962The proper pathwidth of a graph. St000315The number of isolated vertices of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001281The normalized isoperimetric number of a graph. St000386The number of factors DDU in a Dyck path. St000781The number of proper colouring schemes of a Ferrers diagram. St000379The number of Hamiltonian cycles in a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001695The 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. St001141The number of occurrences of hills of size 3 in a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St001890The maximum magnitude of the Möbius function of a poset. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. 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. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter 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. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. 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. 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. St001175The size of a partition minus the hook length of the base cell. St001248Sum of the even parts of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000078The number of alternating sign matrices whose left key is the permutation. St001256Number of simple reflexive modules that are 2-stable reflexive. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. 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$. 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. St000255The number of reduced Kogan faces with the permutation as type. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000217The number of occurrences of the pattern 312 in a permutation. St000234The number of global ascents of a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St000056The decomposition (or block) number of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000570The Edelman-Greene number of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St001162The minimum jump of a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001344The neighbouring number of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000317The cycle descent number of a permutation. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000542The number of left-to-right-minima of a permutation. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000962The 3-shifted major index of a permutation. 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. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. 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. St001139The number of occurrences of hills of size 2 in a Dyck path. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. 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. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001381The fertility of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St001471The magnitude of a Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St000929The constant term of the character polynomial of an integer partition. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000264The girth of a graph, which is not a tree. St000699The toughness times the least common multiple of 1,. St001570The minimal number of edges to add to make a graph Hamiltonian. 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. St000069The number of maximal elements of a poset. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. 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. St001846The number of elements which do not have a complement in the lattice. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000182The number of permutations whose cycle type is the given integer partition. St000183The side length of the Durfee square of an integer partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000326The position of the first one in a binary word after appending a 1 at the end. St000517The Kreweras number of an integer partition. St000694The number of affine bounded permutations that project to a given permutation. St000847The number of standard Young tableaux whose descent set is the binary word. St000897The number of different multiplicities of parts of an integer partition. St000913The number of ways to refine the partition into singletons. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. 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)$. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001590The crossing number of a perfect matching. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St000290The major index of a binary word. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000347The inversion sum of a binary word. St000629The defect of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. 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. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001214The aft of an integer partition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001435The number of missing boxes in the first row. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001438The number of missing boxes of a skew partition. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001485The modular major index of a binary word. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001811The Castelnuovo-Mumford regularity of a permutation. St001060The distinguishing index of a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St000143The largest repeated part of a partition. St000185The weighted size of a partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St000225Difference between largest and smallest parts in a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001651The Frankl number of a lattice. St001568The smallest positive integer that does not appear twice in the partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St001845The number of join irreducibles minus the rank of a lattice. St001691The number of kings in a graph. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St001081The number of minimal length factorizations of a permutation into star transpositions. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001665The number of pure excedances of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St000917The open packing number of a graph. St000486The number of cycles of length at least 3 of a permutation. St000788The number of nesting-similar perfect matchings of a perfect matching. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000488The number of cycles of a permutation of length at most 2. St000787The number of flips required to make a perfect matching noncrossing. St000068The number of minimal elements in a poset. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001730The number of times the path corresponding to a binary word crosses the base line. St000908The length of the shortest maximal antichain in a poset. St001877Number of indecomposable injective modules with projective dimension 2. St001301The first Betti number of the order complex associated with the poset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001432The order dimension of the partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000944The 3-degree of an integer partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!