Identifier
Values
[1,1] => ([(0,1)],2) => ([(0,1)],2) => 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,2] => ([(1,2)],3) => ([(0,1)],2) => 0
[2,1] => ([(0,2),(1,2)],3) => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[1,1,2] => ([(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,3] => ([(2,3)],4) => ([(0,1)],2) => 0
[2,2] => ([(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,1] => ([(0,3),(1,3),(2,3)],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
[1,1,3] => ([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,4] => ([(3,4)],5) => ([(0,1)],2) => 0
[2,3] => ([(2,4),(3,4)],5) => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,2] => ([(1,4),(2,4),(3,4)],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
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16) => 0
[1,1,4] => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,5] => ([(4,5)],6) => ([(0,1)],2) => 0
[2,4] => ([(3,5),(4,5)],6) => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,3] => ([(2,5),(3,5),(4,5)],6) => ([(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
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16) => 0
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,12),(1,13),(1,14),(1,15),(2,9),(2,10),(2,11),(2,15),(3,7),(3,8),(3,11),(3,14),(4,6),(4,8),(4,10),(4,13),(5,6),(5,7),(5,9),(5,12),(6,16),(6,19),(6,22),(7,16),(7,17),(7,20),(8,16),(8,18),(8,21),(9,17),(9,19),(9,23),(10,18),(10,19),(10,24),(11,17),(11,18),(11,25),(12,20),(12,22),(12,23),(13,21),(13,22),(13,24),(14,20),(14,21),(14,25),(15,23),(15,24),(15,25),(16,29),(16,30),(17,26),(17,30),(18,27),(18,30),(19,28),(19,30),(20,26),(20,29),(21,27),(21,29),(22,28),(22,29),(23,26),(23,28),(24,27),(24,28),(25,26),(25,27),(26,31),(27,31),(28,31),(29,31),(30,31)],32) => 0
[1,1,5] => ([(4,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,6] => ([(5,6)],7) => ([(0,1)],2) => 0
[2,5] => ([(4,6),(5,6)],7) => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,4] => ([(3,6),(4,6),(5,6)],7) => ([(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
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16) => 0
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,12),(1,13),(1,14),(1,15),(2,9),(2,10),(2,11),(2,15),(3,7),(3,8),(3,11),(3,14),(4,6),(4,8),(4,10),(4,13),(5,6),(5,7),(5,9),(5,12),(6,16),(6,19),(6,22),(7,16),(7,17),(7,20),(8,16),(8,18),(8,21),(9,17),(9,19),(9,23),(10,18),(10,19),(10,24),(11,17),(11,18),(11,25),(12,20),(12,22),(12,23),(13,21),(13,22),(13,24),(14,20),(14,21),(14,25),(15,23),(15,24),(15,25),(16,29),(16,30),(17,26),(17,30),(18,27),(18,30),(19,28),(19,30),(20,26),(20,29),(21,27),(21,29),(22,28),(22,29),(23,26),(23,28),(24,27),(24,28),(25,26),(25,27),(26,31),(27,31),(28,31),(29,31),(30,31)],32) => 0
[6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,17),(1,18),(1,19),(1,20),(1,21),(2,13),(2,14),(2,15),(2,16),(2,21),(3,10),(3,11),(3,12),(3,16),(3,20),(4,8),(4,9),(4,12),(4,15),(4,19),(5,7),(5,9),(5,11),(5,14),(5,18),(6,7),(6,8),(6,10),(6,13),(6,17),(7,22),(7,25),(7,28),(7,34),(8,22),(8,23),(8,26),(8,32),(9,22),(9,24),(9,27),(9,33),(10,23),(10,25),(10,29),(10,35),(11,24),(11,25),(11,30),(11,36),(12,23),(12,24),(12,31),(12,37),(13,26),(13,28),(13,29),(13,38),(14,27),(14,28),(14,30),(14,39),(15,26),(15,27),(15,31),(15,40),(16,29),(16,30),(16,31),(16,41),(17,32),(17,34),(17,35),(17,38),(18,33),(18,34),(18,36),(18,39),(19,32),(19,33),(19,37),(19,40),(20,35),(20,36),(20,37),(20,41),(21,38),(21,39),(21,40),(21,41),(22,45),(22,46),(22,56),(23,42),(23,46),(23,53),(24,43),(24,46),(24,54),(25,44),(25,46),(25,55),(26,42),(26,45),(26,47),(27,43),(27,45),(27,48),(28,44),(28,45),(28,49),(29,42),(29,44),(29,50),(30,43),(30,44),(30,51),(31,42),(31,43),(31,52),(32,47),(32,53),(32,56),(33,48),(33,54),(33,56),(34,49),(34,55),(34,56),(35,50),(35,53),(35,55),(36,51),(36,54),(36,55),(37,52),(37,53),(37,54),(38,47),(38,49),(38,50),(39,48),(39,49),(39,51),(40,47),(40,48),(40,52),(41,50),(41,51),(41,52),(42,57),(42,62),(43,58),(43,62),(44,59),(44,62),(45,60),(45,62),(46,61),(46,62),(47,57),(47,60),(48,58),(48,60),(49,59),(49,60),(50,57),(50,59),(51,58),(51,59),(52,57),(52,58),(53,57),(53,61),(54,58),(54,61),(55,59),(55,61),(56,60),(56,61),(57,63),(58,63),(59,63),(60,63),(61,63),(62,63)],64) => 0
search for individual values
searching the database for the individual values of this statistic
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.
Map
connected vertex partitions
Description
Sends a graph to the lattice of its connected vertex partitions.
A connected vertex partition of a graph $G = (V,E)$ is a set partition of $V$ such that each part induced a connected subgraph of $G$. The connected vertex partitions of $G$ form a lattice under refinement. If $G = K_n$ is a complete graph, the resulting lattice is the lattice of set partitions on $n$ elements.
In the language of matroid theory, this map sends a graph to the lattice of flats of its graphic matroid. The resulting lattice is a geometric lattice, i.e. it is atomistic and semimodular.
Map
to threshold graph
Description
The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.