The maximum of the length and the largest part of the integer partition. This is the side length of the smallest square the Ferrers diagram of the partition fits into. It is also the minimal number of colours required to colour the cells of the Ferrers diagram such that no two cells in a column or in a row have the same colour, see [1]. See also [[St001214]].

The largest length of a factor maximising the subword complexity. Let $p_w(n)$ be the number of distinct factors of length $n$. Then the statistic is the largest $n$ such that $p_w(n)$ is maximal: $$ H_w = \max\{n: p_w(n)\text{ is maximal}\} $$ A related statistic is the number of distinct factors of arbitrary length, also known as subword complexity, [[St000294]].

The minimal number such that all substrings of this length are unique.

The length of a longest palindromic factor of a binary word. A factor of a word is a sequence of consecutive letters. This statistic records the maximal length of a palindromic factor.

The length of a longest palindromic subword of a binary word. A subword of a word is a word obtained by deleting letters. This statistic records the maximal length of a palindromic subword. Any binary word of length $n$ contains a palindromic subword of length at least $n/2$, obtained by removing all occurrences of the letter which occurs less often. This bound is obtained by the word beginning with $n/2$ zeros and ending with $n/2$ ones.

The semiperimeter of the associated bargraph. Interpret the composition as the sequence of heights of the bars of a bargraph. This statistic is the semiperimeter of the polygon determined by the axis and the bargraph. Put differently, it is the sum of the number of up steps and the number of horizontal steps when regarding the bargraph as a path with up, horizontal and down steps.

The degree of the graph. This is the maximal vertex degree of a graph.

The number of weak exceedances (also weak excedences) of a permutation. This is defined as $$\operatorname{wex}(\sigma)=\#\{i:\sigma(i) \geq i\}.$$ The number of weak exceedances is given by the number of exceedances (see [[St000155]]) plus the number of fixed points (see [[St000022]]) of $\sigma$.

The maximal part of the shifted composition of an integer partition. A partition $\lambda = (\lambda_1,\ldots,\lambda_k)$ is shifted into a composition by adding $i-1$ to the $i$-th part. The statistic is then $\operatorname{max}_i\{ \lambda_i + i - 1 \}$. See also [[St000380]].

The maximal number of occurrences of a colour in a proper colouring of a graph. To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions. For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.