The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is odd. The case of an even minimum is [[St000621]].

The number of semistandard Young tableaux of partition weight of given shape. The weight of a semistandard Young tableaux is the sequence $(m_1, m_2,\dots)$, where $m_i$ is the number of occurrences of the number $i$ in the tableau. This statistic counts those tableaux whose weight is a weakly decreasing sequence. Alternatively, this is the sum of the entries in the column specified by the partition of the change of basis matrix from Schur functions to monomial symmetric functions.

The number of multipartitions of sizes given by an integer partition. This is, for $\lambda = (\lambda_1,\ldots,\lambda_n)$, this is the number of $n$-tuples $(\lambda^{(1)},\ldots,\lambda^{(n)})$ of partitions $\lambda^{(i)}$ such that $\lambda^{(i)} \vdash \lambda_i$.

The number of positive values of the symmetric group character corresponding to the partition. For example, the character values of the irreducible representation $S^{(2,2)}$ are $2$ on the conjugacy classes $(4)$ and $(2,2)$, $0$ on the conjugacy classes $(3,1)$ and $(1,1,1,1)$, and $-1$ on the conjugacy class $(2,1,1)$. Therefore, the statistic on the partition $(2,2)$ is $2$.

The Hamming dimension of a graph. Let $H(n, k)$ be the graph whose vertices are the subsets of $\{1,\dots,n\}$, and $(u,v)$ being an edge, for $u\neq v$, if the symmetric difference of $u$ and $v$ has cardinality at most $k$. This statistic is the smallest $n$ such that the graph is an induced subgraph of $H(n, k)$ for some $k$.

The pebbling number of a connected graph.

The maximum cut size of a graph. A '''cut''' is a set of edges which connect different sides of a vertex partition $V = A \sqcup B$.

The number of facets of the stable set polytope of a graph. The stable set polytope of a graph $G$ is the convex hull of the characteristic vectors of stable (or independent) sets of vertices of $G$ inside $\mathbb{R}^{V(G)}$.