The number of occurrences of the pattern 312 in a permutation.

The number of occurrences of the pattern 213 in a permutation.

The number of occurrences of the pattern 132 in a permutation.

Number of subsets of size 3 of elements in a poset that form a "v". For a finite poset $(P,\leq)$, this is the number of sets $\{x,y,z\} \in \binom{P}{3}$ that form a "v"-subposet (i.e., a subposet consisting of a bottom element covered by two incomparable elements).

The number of occurrences of the pattern 231 in a permutation.

The number of occurrences of an 132 pattern in an ordered set partition. An occurrence of a pattern $\pi\in\mathfrak S_k$ ordered set partition with blocks $B_1|\dots|B_\ell$ is a sequence of elements $e_1,\dots,e_k$ with $e_i\in B_{j_i}$ and $j_1 < \dots < j_k$ order-isomorphic to $\pi$.

The number of characters of the symmetric group whose value on the partition is zero. The maximal value for any given size is recorded in [2].

The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $1$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$. The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].

The largest eigenvalue of a graph if it is integral. If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree. This statistic is undefined if the largest eigenvalue of the graph is not integral.

The monochromatic index of a connected graph. This is the maximal number of colours such that there is a colouring of the edges where any two vertices can be joined by a monochromatic path. For example, a circle graph other than the triangle can be coloured with at most two colours: one edge blue, all the others red.