Your data matches 583 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000068: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2)],3)
=> 1 = 0 + 1
([(0,2),(2,1)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
Description
The number of minimal elements in a poset.
St000069: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 1 = 0 + 1
Description
The number of maximal elements of a poset.
St000909: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
Description
The number of maximal chains of maximal size in a poset.
St001399: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
Description
The distinguishing number of a poset. This is the minimal number of colours needed to colour the vertices of a poset, such that only the trivial automorphism of the poset preserves the colouring. See also [[St000469]], which is the same concept for graphs.
Mp00198: Posets incomparability graphGraphs
St001479: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
Description
The number of bridges of a graph. A bridge is an edge whose removal increases the number of connected components of the graph.
Mp00198: Posets incomparability graphGraphs
St001826: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
Description
The maximal number of leaves on a vertex of a graph.
Mp00198: Posets incomparability graphGraphs
St000273: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1)],2)
=> ([],2)
=> 2 = 1 + 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
Description
The domination number of a graph. The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
Mp00198: Posets incomparability graphGraphs
St000287: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1)],2)
=> ([],2)
=> 2 = 1 + 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
Description
The number of connected components of a graph.
Mp00198: Posets incomparability graphGraphs
St000363: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,1)],2)
=> ([],2)
=> 1 = 0 + 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
Description
The number of minimal vertex covers of a graph. A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices. This is also the leading coefficient of the clique polynomial of the complement of $G$. This is also the number of independent sets of maximal cardinality of $G$.
Mp00198: Posets incomparability graphGraphs
St000544: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([(0,1)],2)
=> 1 = 0 + 1
([(0,1)],2)
=> ([],2)
=> 2 = 1 + 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
Description
The cop number of a graph. This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
The following 573 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000916The packing number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001829The common independence number of a graph. St000137The Grundy value of an integer partition. St000142The number of even parts of a partition. St000183The side length of the Durfee square of an integer partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000377The dinv defect of an integer partition. St000475The number of parts equal to 1 in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000783The side length of the largest staircase partition fitting into a partition. St000931The number of occurrences of the pattern UUU in a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001091The number of parts in an integer partition whose next smaller part has the same size. St001176The size of a partition minus its first part. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001423The number of distinct cubes in a binary word. St001587Half of the largest even part of an integer partition. St001615The number of join prime elements of a lattice. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001827The number of two-component spanning forests of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001939The number of parts that are equal to their multiplicity in the integer partition. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000093The cardinality of a maximal independent set of vertices of a graph. St000160The multiplicity of the smallest part of a partition. St000286The number of connected components of the complement of a graph. St000309The number of vertices with even degree. St000346The number of coarsenings of a partition. St000383The last part of an integer composition. St000445The number of rises of length 1 of a Dyck path. St000460The hook length of the last cell along the main diagonal of an integer partition. St000482The (zero)-forcing number of a graph. St000548The number of different non-empty partial sums of an integer partition. St000553The number of blocks of a graph. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000917The open packing number of a graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001286The annihilation number of a graph. St001316The domatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001342The number of vertices in the center of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001462The number of factors of a standard tableaux under concatenation. St001463The number of distinct columns in the nullspace of a graph. St001672The restrained domination number of a graph. St001691The number of kings in a graph. St001828The Euler characteristic of a graph. St001933The largest multiplicity of a part in an integer partition. St001949The rigidity index of a graph. St000258The burning number of a graph. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000012The area of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000053The number of valleys of the Dyck path. St000120The number of left tunnels of a Dyck path. St000148The number of odd parts of a partition. St000157The number of descents of a standard tableau. St000171The degree of the graph. St000228The size of a partition. St000272The treewidth of a graph. St000306The bounce count of a Dyck path. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000362The size of a minimal vertex cover of a graph. St000369The dinv deficit of a Dyck path. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000454The largest eigenvalue of a graph if it is integral. St000459The hook length of the base cell of a partition. St000519The largest length of a factor maximising the subword complexity. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000549The number of odd partial sums of an integer partition. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000741The Colin de Verdière graph invariant. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000784The maximum of the length and the largest part of the integer partition. St000867The sum of the hook lengths in the first row of an integer partition. St000946The sum of the skew hook positions in a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001127The sum of the squares of the parts of a partition. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001274The number of indecomposable injective modules with projective dimension equal to two. St001277The degeneracy of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001323The independence gap of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001584The area statistic between a Dyck path and its bounce path. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001743The discrepancy of a graph. St001777The number of weak descents in an integer composition. St001792The arboricity of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001812The biclique partition number of a graph. St001869The maximum cut size of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001956The comajor index for set-valued two-row standard Young tableaux. St001962The proper pathwidth of a graph. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000063The number of linear extensions of a certain poset defined for an integer partition. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000108The number of partitions contained in the given partition. St000147The largest part of an integer partition. St000172The Grundy number of a graph. St000181The number of connected components of the Hasse diagram for the poset. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000288The number of ones in a binary word. St000297The number of leading ones in a binary word. St000321The number of integer partitions of n that are dominated by an integer partition. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000378The diagonal inversion number of an integer partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000392The length of the longest run of ones in a binary word. St000532The total number of rook placements on a Ferrers board. St000617The number of global maxima of a Dyck path. St000655The length of the minimal rise of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000676The number of odd rises of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000722The number of different neighbourhoods in a graph. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000767The number of runs in an integer composition. St000778The metric dimension of a graph. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000908The length of the shortest maximal antichain in a poset. St000918The 2-limited packing number of a graph. St000935The number of ordered refinements of an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001330The hat guessing number of a graph. St001389The number of partitions of the same length below the given integer partition. St001400The total number of Littlewood-Richardson tableaux of given shape. St001471The magnitude of a Dyck path. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001485The modular major index of a binary word. St001494The Alon-Tarsi number of a graph. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001523The degree of symmetry of a Dyck path. St001530The depth of a Dyck path. St001571The Cartan determinant of the integer partition. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001670The connected partition number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001746The coalition number of a graph. St001883The mutual visibility number of a graph. St001910The height of the middle non-run of a Dyck path. St001963The tree-depth of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000439The position of the first down step of a Dyck path. St000636The hull number of a graph. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001180Number of indecomposable injective modules with projective dimension at most 1. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001486The number of corners of the ribbon associated with an integer composition. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001654The monophonic hull number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000910The number of maximal chains of minimal length in a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001621The number of atoms of a lattice. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001281The normalized isoperimetric number of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001596The number of two-by-two squares inside a skew partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000633The size of the automorphism group of a poset. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001597The Frobenius rank of a skew partition. St000907The number of maximal antichains of minimal length in a poset. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000117The number of centered tunnels of a Dyck path. St000271The chromatic index of a graph. St000387The matching number of a graph. St000552The number of cut vertices of a graph. St000932The number of occurrences of the pattern UDU in a Dyck path. St000984The number of boxes below precisely one peak. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001071The beta invariant of the graph. St001117The game chromatic index of a graph. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001305The number of induced cycles on four vertices in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001592The maximal number of simple paths between any two different vertices of a graph. St001689The number of celebrities in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001816Eigenvalues of the top-to-random operator acting on a simple module. St000075The orbit size of a standard tableau under promotion. St000388The number of orbits of vertices of a graph under automorphisms. St000450The number of edges minus the number of vertices plus 2 of a graph. St000456The monochromatic index of a connected graph. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000993The multiplicity of the largest part of an integer partition. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001271The competition number of a graph. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001645The pebbling number of a connected graph. St000315The number of isolated vertices of a graph. St000469The distinguishing number of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000144The pyramid weight of the Dyck path. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001624The breadth of a lattice. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000478Another weight of a partition according to Alladi. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000145The Dyson rank of a partition. St000268The number of strongly connected orientations of a graph. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000535The rank-width of a graph. St000567The sum of the products of all pairs of parts. St000640The rank of the largest boolean interval in a poset. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000699The toughness times the least common multiple of 1,. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000929The constant term of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St001073The number of nowhere zero 3-flows of a graph. St001095The number of non-isomorphic posets with precisely one further covering relation. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001280The number of parts of an integer partition that are at least two. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001333The cardinality of a minimal edge-isolating set of a graph. St001345The Hamming dimension of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001391The disjunction number of a graph. St001393The induced matching number of a graph. St001512The minimum rank of a graph. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001668The number of points of the poset minus the width of the poset. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000096The number of spanning trees of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000302The determinant of the distance matrix of a connected graph. St000344The number of strongly connected outdegree sequences of a graph. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000442The maximal area to the right of an up step of a Dyck path. St000466The Gutman (or modified Schultz) index of a connected graph. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000680The Grundy value for Hackendot on posets. St000681The Grundy value of Chomp on Ferrers diagrams. St000693The modular (standard) major index of a standard tableau. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St000947The major index east count of a Dyck path. St000948The chromatic discriminant of a graph. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001139The number of occurrences of hills of size 2 in a Dyck path. St001249Sum of the odd parts of a partition. St001383The BG-rank of an integer partition. St001395The number of strictly unfriendly partitions of a graph. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001651The Frankl number of a lattice. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001961The sum of the greatest common divisors of all pairs of parts. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000467The hyper-Wiener index of a connected graph. St001175The size of a partition minus the hook length of the base cell. St001432The order dimension of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000379The number of Hamiltonian cycles in a graph. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001118The acyclic chromatic index of a graph. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000080The rank of the poset. St000100The number of linear extensions of a poset. St000189The number of elements in the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000327The number of cover relations in a poset. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000527The width of the poset. St000528The height of a poset. St000632The jump number of the poset. St000635The number of strictly order preserving maps of a poset into itself. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St000914The sum of the values of the Möbius function of a poset. St001268The size of the largest ordinal summand in the poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001301The first Betti number of the order complex associated with the poset. St001343The dimension of the reduced incidence algebra of a poset. St001396Number of triples of incomparable elements in a finite poset. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001510The number of self-evacuating linear extensions of a finite poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001637The number of (upper) dissectors of a poset. St001717The largest size of an interval in a poset. St001718The number of non-empty open intervals in a poset. St001779The order of promotion on the set of linear extensions of a poset. St001813The product of the sizes of the principal order filters in a poset. St001815The number of order preserving surjections from a poset to a total order. St001890The maximum magnitude of the Möbius function of a poset. St001902The number of potential covers of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001964The interval resolution global dimension of a poset. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000284The Plancherel distribution on integer partitions. St000618The number of self-evacuating tableaux of given shape. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000944The 3-degree of an integer partition. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001128The exponens consonantiae of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001527The cyclic permutation representation number of an integer partition. St001541The Gini index of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type.