Your data matches 235 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001719
(load all 11 compositions to match this statistic)
Mapping
St001719: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 1 = 0 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 1 = 0 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 2 = 1 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => 1 = 0 + 1
Description
The number of shortest chains of small intervals from the bottom to the top in a lattice. An interval $[a, b]$ in a lattice is small if $b$ is a join of elements covering $a$.
Matching statistic: St000447
(load all 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000447: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The number of pairs of vertices of a graph with distance 3. This is the coefficient of the cubic term of the Wiener polynomial, also called Wiener polarity index.
Matching statistic: St001305
(load all 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001305: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The number of induced cycles on four vertices in a graph.
Matching statistic: St001306
(load all 7 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001306: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The number of induced paths on four vertices in a graph.
Matching statistic: St001307
(load all 4 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001307: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The number of induced stars on four vertices in a graph.
Matching statistic: St001309
(load all 8 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001309: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The number of four-cliques in a graph.
Matching statistic: St001310
(load all 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001310: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
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 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001324: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
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 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001326: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
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: St001327
(load all 5 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001327: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(2,4),(3,4)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 0
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(3,5),(4,5)],6)
 => 0
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(2,5),(3,5),(4,5)],6)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(3,5),(4,5)],6)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 0
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 0
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(3,5),(4,5)],6)
 => 0
Description
The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. A graph is a split graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,b)$ is an edge and $(b,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.
The following 225 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. 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. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001871The number of triconnected components of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001624The breadth of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000632The jump number of the poset. St000671The maximin edge-connectivity for choosing a subgraph. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. 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. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000807The sum of the heights of the valleys of the associated bargraph. St001175The size of a partition minus the hook length of the base cell. St001350Half of the Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001575The minimal number of edges to add or remove to make a graph edge transitive. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000071The number of maximal chains in a poset. St000183The side length of the Durfee square of an integer partition. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000527The width of the poset. St000535The rank-width of a graph. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000805The number of peaks of the associated bargraph. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000909The number of maximal chains of maximal size in a poset. St000913The number of ways to refine the partition into singletons. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001268The size of the largest ordinal summand in the poset. St001286The annihilation number of a graph. St001399The distinguishing number of a poset. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001510The number of self-evacuating linear extensions of a finite poset. St001743The discrepancy of a 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. St001779The order of promotion on the set of linear extensions of a poset. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000449The number of pairs of vertices of a graph with distance 4. St001095The number of non-isomorphic posets with precisely one further covering relation. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. 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. St001331The size of the minimal feedback vertex set. St001335The cardinality of a minimal cycle-isolating set of a graph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001736The total number of cycles in a graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000069The number of maximal elements of a poset. St000897The number of different multiplicities of parts of an integer partition. St001272The number of graphs with the same degree sequence. St000095The number of triangles of a graph. St000322The skewness of a graph. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. 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. 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. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001484The number of singletons of an integer partition. 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001964The interval resolution global dimension of a poset. St000068The number of minimal elements in a poset. St000100The number of linear extensions of a poset. St000181The number of connected components of the Hasse diagram for the poset. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. St001271The competition number of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001481The minimal height of a peak of a Dyck path. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. 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$. St000379The number of Hamiltonian cycles in a graph. St000475The number of parts equal to 1 in a partition. St000929The constant term of the character polynomial of an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001651The Frankl number of a lattice. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000759The smallest missing part in an integer partition. St000993The multiplicity of the largest part of an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St000478Another weight of a partition according to Alladi. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St000667The greatest common divisor of the parts of the partition. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001820The size of the image of the pop stack sorting operator. St000635The number of strictly order preserving maps of a poset into itself. St001890The maximum magnitude of the Möbius function of a poset. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. 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. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000699The toughness times the least common multiple of 1,. St000944The 3-degree of an integer partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001281The normalized isoperimetric number of a graph. St001568The smallest positive integer that does not appear twice in the partition. St001613The binary logarithm of the size of the center of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St001621The number of atoms of a lattice. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000313The number of degree 2 vertices of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000403The Szeged index minus the Wiener index of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000552The number of cut vertices of a graph. St000637The length of the longest cycle in a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001119The length of a shortest maximal path in a graph. St001308The number of induced paths on three vertices in a 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. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001351The Albertson index of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001374The Padmakar-Ivan index of a graph. St001395The number of strictly unfriendly partitions of a graph. St001638The book thickness of a graph. St001689The number of celebrities in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001723The differential of a graph. St001724The 2-packing differential of 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. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. 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. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001316The domatic number of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001546The number of monomials in the Tutte polynomial of a graph. St001694The number of maximal dissociation sets in a graph. St001716The 1-improper chromatic number of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000456The monochromatic index of a connected graph. St000914The sum of the values of the Möbius function of a poset. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000310The minimal degree of a vertex of a graph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000315The number of isolated vertices of a graph. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001765The number of connected components of the friends and strangers graph. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001118The acyclic chromatic index of a graph. St000264The girth of a graph, which is not a tree. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St001330The hat guessing number of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset.