Your data matches 36 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000171
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000171: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 4
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
Description
The degree of the graph. This is the maximal vertex degree of a graph.
Matching statistic: St000272
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000272: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 4
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
Description
The treewidth of a graph. A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
Matching statistic: St000454
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 4
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
Description
The largest eigenvalue of a graph if it is integral. If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree. This statistic is undefined if the largest eigenvalue of the graph is not integral.
Matching statistic: St000536
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000536: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 3
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 4
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 4
Description
The pathwidth of a graph.
Matching statistic: St000482
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000482: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(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,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(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,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(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,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 4 = 3 + 1
([(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,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 4 = 3 + 1
([(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,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(2,6),(3,6),(4,6),(5,6)],7)
 => ([(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)
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(0,5),(0,6),(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)
 => 5 = 4 + 1
Description
The (zero)-forcing number of a graph. This is the minimal number of vertices initially coloured black, such that eventually all vertices of the graph are coloured black when using the following rule: when $u$ is a black vertex of $G$, and exactly one neighbour $v$ of $u$ is white, then colour $v$ black.
Matching statistic: St001670
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001670: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 2 = 1 + 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 3 = 2 + 1
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 4 = 3 + 1
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 4 = 3 + 1
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 5 = 4 + 1
Description
The connected partition number of a graph. This is the maximal number of blocks of a set partition $P$ of the set of vertices of a graph such that contracting each block of $P$ to a single vertex yields a clique. Also called the pseudoachromatic number of a graph. This is the largest $n$ such that there exists a (not necessarily proper) $n$-coloring of the graph so that every two distinct colors are adjacent.
Matching statistic: St001883
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001883: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 2 = 1 + 1
([(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)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 3 = 2 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 3 = 2 + 1
([(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)
 => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 4 = 3 + 1
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 4 = 3 + 1
([(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)
 => ([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
 => ([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,5),(0,6),(1,2),(1,4),(2,3),(3,5),(4,6)],7)
 => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,5),(4,6)],7)
 => 5 = 4 + 1
Description
The mutual visibility number of a graph. This is the largest cardinality of a subset $P$ of vertices of a graph $G$, such that for each pair of vertices in $P$ there is a shortest path in $G$ which contains no other point in $P$. In particular, the mutual visibility number of the disjoint union of two graphs is the maximum of their mutual visibility numbers.
Matching statistic: St000189
Mapping
Mp00263: Lattices —join irreducibles⟶ Posets
St000189: Posets ⟶ ℤResult quality: 92% ●values known / values provided: 92%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],0)
 => ? = 0 + 1
([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 3 = 2 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => 4 = 3 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([],5)
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(1,4),(3,2),(4,3)],5)
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,3),(1,4),(4,2)],5)
 => 5 = 4 + 1
Description
The number of elements in the poset.
Matching statistic: St001636
Mapping
Mp00263: Lattices —join irreducibles⟶ Posets
St001636: Posets ⟶ ℤResult quality: 92% ●values known / values provided: 92%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],0)
 => ? = 0 + 1
([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 3 = 2 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => 4 = 3 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([],5)
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(1,4),(3,2),(4,3)],5)
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,3),(1,4),(4,2)],5)
 => 5 = 4 + 1
Description
The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.
Matching statistic: St000228
(load all 2 compositions to match this statistic)
Mapping
Mp00263: Lattices —join irreducibles⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000228: Integer partitions ⟶ ℤResult quality: 92% ●values known / values provided: 92%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],0)
 => ?
 => ? = 0 + 1
([(0,1)],2)
 => ([],1)
 => [1]
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => [2]
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => [1,1]
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => [1,1,1]
 => 3 = 2 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => [2,1]
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => [1,1,1,1]
 => 4 = 3 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => [3,1]
 => 4 = 3 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => [2,2]
 => 4 = 3 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([],5)
 => [1,1,1,1,1]
 => 5 = 4 + 1
([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7)
 => ([(1,4),(3,2),(4,3)],5)
 => [4,1]
 => 5 = 4 + 1
([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7)
 => ([(0,3),(1,4),(4,2)],5)
 => [3,2]
 => 5 = 4 + 1
Description
The size of a partition. This statistic is the constant statistic of the level sets.
The following 26 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001342The number of vertices in the center of a graph. St001746The coalition number of a graph. St000636The hull number of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001875The number of simple modules with projective dimension at most 1. St001622The number of join-irreducible elements of a lattice. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001962The proper pathwidth of a graph. St000822The Hadwiger number of the graph. St001286The annihilation number of a graph. St001644The dimension of a graph. St000668The least common multiple of the parts of the partition. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001742The difference of the maximal and the minimal degree in a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000264The girth of a graph, which is not a tree. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001570The minimal number of edges to add to make a graph Hamiltonian.