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

The diameter of a connected graph. This is the greatest distance between any pair of vertices.

The number of proper colouring schemes of a Ferrers diagram. A colouring of a Ferrers diagram is proper if no two cells in a row or in a column have the same colour. The minimal number of colours needed is the maximum of the length and the first part of the partition, because we can restrict a latin square to the shape. We can associate to each colouring the integer partition recording how often each colour is used, see [1]. This statistic is the number of distinct such integer partitions that occur.

The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition.

Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. Given $\lambda$ count how many ''integer partitions'' $w$ (weight) there are, such that $P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.