Your data matches 47 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000189
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
St000189: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4 = 5 - 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)
 => 5 = 6 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 5 = 6 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
([(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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
Description
The number of elements in the poset.
Matching statistic: St001717
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
St001717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4 = 5 - 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)
 => 5 = 6 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 5 = 6 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
([(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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
Description
The largest size of an interval in a poset.
Matching statistic: St001300
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
St001300: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 0 = 2 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 3 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 5 - 2
([(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)
 => 4 = 6 - 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 4 = 6 - 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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
Description
The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset.
Matching statistic: St000228
(load all 7 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => [1]
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4 = 5 - 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)
 => [3,1,1]
 => 5 = 6 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [4,1]
 => 5 = 6 - 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)
 => [3,1,1,1]
 => 6 = 7 - 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)
 => [4,1,1]
 => 6 = 7 - 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)
 => [4,1,1]
 => 6 = 7 - 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)
 => [5,1]
 => 6 = 7 - 1
([(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)
 => [4,1,1]
 => 6 = 7 - 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)
 => [4,2]
 => 6 = 7 - 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)
 => [4,2]
 => 6 = 7 - 1
Description
The size of a partition. This statistic is the constant statistic of the level sets.
Matching statistic: St001342
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001342: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4 = 5 - 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)
 => 5 = 6 - 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)
 => 5 = 6 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
([(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)
 => 6 = 7 - 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)
 => 6 = 7 - 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)
 => 6 = 7 - 1
Description
The number of vertices in the center of a graph. The center of a graph is the set of vertices whose maximal distance to any other vertex is minimal. In particular, if the graph is disconnected, all vertices are in the certer.
Matching statistic: St001622
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001622: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4 = 5 - 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,5),(2,7),(2,8),(3,6),(3,8),(4,6),(4,7),(5,2),(5,3),(5,4),(6,9),(7,9),(8,9),(9,1)],10)
 => 5 = 6 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => 5 = 6 - 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,6),(2,10),(2,11),(2,12),(3,8),(3,9),(3,12),(4,7),(4,9),(4,11),(5,7),(5,8),(5,10),(6,2),(6,3),(6,4),(6,5),(7,13),(7,16),(8,13),(8,14),(9,13),(9,15),(10,14),(10,16),(11,15),(11,16),(12,14),(12,15),(13,17),(14,17),(15,17),(16,17),(17,1)],18)
 => 6 = 7 - 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)
 => ([(0,6),(2,10),(2,11),(3,7),(3,9),(4,7),(4,8),(5,2),(5,8),(5,9),(6,3),(6,4),(6,5),(7,12),(8,10),(8,12),(9,11),(9,12),(10,13),(11,13),(12,13),(13,1)],14)
 => 6 = 7 - 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)
 => ([(0,6),(2,7),(3,8),(3,10),(4,8),(4,9),(5,3),(5,4),(5,7),(6,2),(6,5),(7,9),(7,10),(8,11),(9,11),(10,11),(11,1)],12)
 => 6 = 7 - 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,6),(2,9),(3,7),(4,2),(4,8),(5,4),(5,7),(6,3),(6,5),(7,8),(8,9),(9,1)],10)
 => 6 = 7 - 1
([(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)
 => ([(0,6),(2,10),(3,8),(3,9),(4,7),(4,9),(5,7),(5,8),(6,3),(6,4),(6,5),(7,11),(8,11),(9,2),(9,11),(10,1),(11,10)],12)
 => 6 = 7 - 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,6),(2,9),(3,8),(4,3),(4,7),(5,2),(5,7),(6,4),(6,5),(7,8),(7,9),(8,10),(9,10),(10,1)],11)
 => 6 = 7 - 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)
 => ([(0,6),(1,7),(2,9),(4,8),(5,1),(5,9),(6,2),(6,5),(7,8),(8,3),(9,4),(9,7)],10)
 => 6 = 7 - 1
Description
The number of join-irreducible elements of a lattice. An element $j$ of a lattice $L$ is '''join irreducible''' if it is not the least element and if $j=x\vee y$, then $j\in\{x,y\}$ for all $x,y\in L$.
Matching statistic: St000987
(load all 6 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0 = 2 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 3 - 2
([(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)
 => 3 = 5 - 2
([(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)
 => 4 = 6 - 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)
 => 4 = 6 - 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)
 => 5 = 7 - 2
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 5 = 7 - 2
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 5 = 7 - 2
([(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)
 => 5 = 7 - 2
([(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)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => 5 = 7 - 2
Description
The number of positive eigenvalues of the Laplacian matrix of the graph. This is the number of vertices minus the number of connected components of the graph.
Matching statistic: St000718
(load all 2 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St000718: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(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,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 5
([(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,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 6
([(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),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => 6
([(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,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
 => 7
Description
The largest Laplacian eigenvalue of a graph if it is integral. This statistic is undefined if the largest Laplacian eigenvalue of the graph is not integral. Various results are collected in Section 3.9 of [1]
Matching statistic: St001645
(load all 4 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001645: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(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,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 5
([(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,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 6
([(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),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => 6
([(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,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
 => 7
Description
The pebbling number of a connected graph.
Matching statistic: St001707
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001707: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(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,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 5
([(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,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 6
([(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),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => 6
([(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,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
 => 7
([(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,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
 => 7
([(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)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
 => 7
Description
The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. Such a partition always exists because of a construction due to Dudek and Pralat [1] and independently Pokrovskiy [2].
The following 37 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001746The coalition number of a graph. St000171The degree of the graph. St000271The chromatic index of a graph. St000293The number of inversions of a binary word. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000734The last entry in the first row of a standard tableau. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001034The area of the parallelogram polyomino associated with the Dyck path. St001118The acyclic chromatic index of a graph. St001120The length of a longest path in a graph. St001725The harmonious chromatic number of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000656The number of cuts of a poset. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001117The game chromatic index of a graph. St001391The disjunction number of a graph. St001706The number of closed sets in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001875The number of simple modules with projective dimension at most 1. St000528The height of a poset. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000912The number of maximal antichains in a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000080The rank of the poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001782The order of rowmotion on the set of order ideals of a 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. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2.