The size of a partition. This statistic is the constant statistic of the level sets.

The Ramsey number of a graph. This is the smallest integer $n$ such that every two-colouring of the edges of the complete graph $K_n$ contains a (not necessarily induced) monochromatic copy of the given graph. [1] Thus, the Ramsey number of the complete graph $K_n$ is the ordinary Ramsey number $R(n,n)$. Very few of these numbers are known, in particular, it is only known that $43\leq R(5,5)\leq 48$. [2,3,4,5]

The number of neutral elements in a lattice. An element $e$ of the lattice $L$ is neutral if the sublattice generated by $e$, $x$ and $y$ is distributive for all $x, y \in L$.

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$.

The number of modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$, and is modular if both $(x, y)$ and $(y, x)$ are modular pairs for every $y\in L$.

The number of left modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$.