Your data matches 168 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000097
(load all 7 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2)],4)
 => ([(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)
 => 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,3)],5)
 => ([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(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)
 => 2
Description
The order of the largest clique of the graph. A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St001654
(load all 4 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St001654: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2)],4)
 => ([(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)
 => 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,3)],5)
 => ([(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)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(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)
 => 2
Description
The monophonic hull number of a graph. The monophonic hull of a set of vertices $M$ of a graph $G$ is the set of vertices that lie on at least one induced path between vertices in $M$. The monophonic hull number is the size of the smallest set $M$ such that the monophonic hull of $M$ is all of $G$. For example, the monophonic hull number of a graph $G$ with $n$ vertices is $n$ if and only if $G$ is a disjoint union of complete graphs.
Matching statistic: St001613
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001613: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
Description
The binary logarithm of the size of the center of a lattice. An element of a lattice is central if it is neutral and has a complement. The subposet induced by central elements is a Boolean lattice.
Matching statistic: St001621
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001621: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
Description
The number of atoms of a lattice. An element of a lattice is an '''atom''' if it covers the least element.
Matching statistic: St000993
(load all 3 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000993: Integer partitions ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([],2)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([],3)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([],4)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 1 = 2 - 1
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([],5)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 1 = 2 - 1
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 1 = 2 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 1 = 2 - 1
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 1 = 2 - 1
([],6)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([],7)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
([],8)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 1
Description
The multiplicity of the largest part of an integer partition.
Matching statistic: St000379
(load all 5 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000379: Graphs ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(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 = 2 - 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],6)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],7)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],8)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
Description
The number of Hamiltonian cycles in a graph. A Hamiltonian cycle in a graph $G$ is a subgraph (this is, a subset of the edges) that is a cycle which contains every vertex of $G$. Since it is unclear whether the graph on one vertex is Hamiltonian, the statistic is undefined for this graph.
Matching statistic: St000699
(load all 5 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000699: Graphs ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(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 = 2 - 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],6)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],7)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],8)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
Description
The toughness times the least common multiple of 1,...,n-1 of a non-complete graph. A graph $G$ is $t$-tough if $G$ cannot be split into $k$ different connected components by the removal of fewer than $tk$ vertices for all integers $k>1$. The toughness of $G$ is the maximal number $t$ such that $G$ is $t$-tough. It is a rational number except for the complete graph, where it is infinity. The toughness of a disconnected graph is zero. This statistic is the toughness multiplied by the least common multiple of $1,\dots,n-1$, where $n$ is the number of vertices of $G$.
Matching statistic: St000929
(load all 4 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000929: Integer partitions ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([],2)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([],3)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([],4)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 0 = 2 - 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 0 = 2 - 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([],5)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 0 = 2 - 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 0 = 2 - 2
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 0 = 2 - 2
([],6)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([],7)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
([],8)
 => ([],1)
 => ([],1)
 => [1]
 => ? = 1 - 2
Description
The constant term of the character polynomial of an integer partition. The definition of the character polynomial can be found in [1]. Indeed, this constant term is $0$ for partitions $\lambda \neq 1^n$ and $1$ for $\lambda = 1^n$.
Matching statistic: St001281
(load all 2 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001281: Graphs ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(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 = 2 - 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 2 - 2
([],6)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],7)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],8)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
Description
The normalized isoperimetric number of a graph. The isoperimetric number, or Cheeger constant, of a graph $G$ is $$ i(G) = \min\left\{\frac{|\partial A|}{|A|}\ : \ A\subseteq V(G), 0 < |A|\leq |V(G)|/2\right\}, $$ where $$ \partial A := \{(x, y)\in E(G)\ : \ x\in A, y\in V(G)\setminus A \}. $$ This statistic is $i(G)\cdot\lfloor n/2\rfloor !$. We leave the statistic undefined for the graph without vertices and the graph with a single vertex.
Matching statistic: St001651
(load all 6 compositions to match this statistic)
Mapping
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00197: Lattices —lattice of congruences⟶ Lattices
St001651: Lattices ⟶ ℤResult quality: 50% ●values known / values provided: 100%●distinct values known / distinct values provided: 50%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],2)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([],3)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,1),(0,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([],4)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,2),(0,3),(3,1)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,3),(3,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,3),(1,2)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,3),(1,2),(1,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0 = 2 - 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([],5)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(1,2),(1,3),(1,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(0,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,2),(0,3),(0,4),(4,1)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,3),(1,4),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0 = 2 - 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0 = 2 - 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0 = 2 - 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,4),(4,2),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0 = 2 - 2
([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([(0,4),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0 = 2 - 2
([],6)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],7)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
([],8)
 => ([],1)
 => ([],1)
 => ([],1)
 => ? = 1 - 2
Description
The Frankl number of a lattice. For a lattice $L$ on at least two elements, this is $$ \max_x(|L|-2|[x, 1]|), $$ where we maximize over all join irreducible elements and $[x, 1]$ denotes the interval from $x$ to the top element. Frankl's conjecture asserts that this number is non-negative, and zero if and only if $L$ is a Boolean lattice.
The following 158 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000914The sum of the values of the Möbius function of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000651The maximal size of a rise in a permutation. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000659The number of rises of length at least 2 of a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000730The maximal arc length of a set partition. St001568The smallest positive integer that does not appear twice in the partition. St000897The number of different multiplicities of parts of an integer partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000808The number of up steps of the associated bargraph. St001261The Castelnuovo-Mumford regularity of a graph. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000535The rank-width of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001743The discrepancy of a graph. St001657The number of twos in an integer partition. St000264The girth of a graph, which is not a tree. St001625The Möbius invariant of a lattice. St001092The number of distinct even parts of a partition. St000298The order dimension or Dushnik-Miller dimension of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001396Number of triples of incomparable elements in a finite poset. St000706The product of the factorials of the multiplicities of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St000010The length of the partition. St000147The largest part of an integer partition. St001587Half of the largest even part of an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000093The cardinality of a maximal independent set of vertices of a graph. St000260The radius of a connected graph. St001720The minimal length of a chain of small intervals in a lattice. St001307The number of induced stars on four vertices in a graph. St001310The number of induced diamond graphs in a graph. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001309The number of four-cliques in a graph. St001095The number of non-isomorphic posets with precisely one further covering relation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000456The monochromatic index of a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St001335The cardinality of a minimal cycle-isolating set of a graph. St000741The Colin de Verdière graph invariant. St001578The minimal number of edges to add or remove to make a graph a line graph. St000322The skewness of a graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000480The number of lower covers of a partition in dominance order. St000346The number of coarsenings of a partition. St000481The number of upper covers of a partition in dominance order. St000668The least common multiple of the parts of the partition. St001330The hat guessing number of a graph. 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. 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. St000917The open packing number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001316The domatic number of a graph. St001656The monophonic position number of a graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001071The beta invariant of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001349The number of different graphs obtained from the given graph by removing an edge. St000258The burning number of a graph. St000273The domination number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000378The diagonal inversion number of an integer partition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000482The (zero)-forcing number of a graph. St000544The cop number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000778The metric dimension of a graph. St000899The maximal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000918The 2-limited packing number of a graph. St001093The detour number of a graph. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001286The annihilation number of a graph. St001315The dissociation number of a graph. 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. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001792The arboricity of a graph. St001829The common independence number of a graph. St001949The rigidity index of a graph. St000256The number of parts from which one can substract 2 and still get an integer partition. St000469The distinguishing number of a graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000636The hull number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001271The competition number of a graph. St001280The number of parts of an integer partition that are at least two. St001340The cardinality of a minimal non-edge isolating set of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001512The minimum rank of a graph. St001655The general position number of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000515The number of invariant set partitions when acting with a permutation of given cycle type. 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$. St000284The Plancherel distribution on integer partitions. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000762The sum of the positions of the weak records of an integer composition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. 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. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. 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. St001057The Grundy value of the game of creating an independent set in a graph. St000454The largest eigenvalue of a graph if it is integral. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001060The distinguishing index of a graph. St001118The acyclic chromatic index of a graph. St001545The second Elser number of a connected graph. St001323The independence gap of a graph. St000660The number of rises of length at least 3 of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000464The Schultz index of a connected graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph.