Identifier
Values
[[1],[2]] => ([],1) => ([],1) => 0
[[1,1],[2]] => ([],1) => ([],1) => 0
[[1],[2],[3]] => ([],1) => ([],1) => 0
[[1,1,1],[2]] => ([],1) => ([],1) => 0
[[1,1],[2,2]] => ([],1) => ([],1) => 0
[[1,1],[2],[3]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2]] => ([],1) => ([],1) => 0
[[1,1,1],[2,2]] => ([],1) => ([],1) => 0
[[1],[2],[3],[4]] => ([],1) => ([],1) => 0
[[1,1,1],[2],[3]] => ([],1) => ([],1) => 0
[[1,1],[2,2],[3]] => ([],1) => ([],1) => 0
[[1,1,1,1,1],[2]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2,2]] => ([],1) => ([],1) => 0
[[1,1,1],[2,2,2]] => ([],1) => ([],1) => 0
[[1,1],[2],[3],[4]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2],[3]] => ([],1) => ([],1) => 0
[[1,1,1],[2,2],[3]] => ([],1) => ([],1) => 0
[[1,1],[2,2],[3,3]] => ([],1) => ([],1) => 0
[[1,1,1,1,1,1],[2]] => ([],1) => ([],1) => 0
[[1,1,1,1,1],[2,2]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2,2,2]] => ([],1) => ([],1) => 0
[[1],[2],[3],[4],[5]] => ([],1) => ([],1) => 0
[[1,1,1],[2],[3],[4]] => ([],1) => ([],1) => 0
[[1,1],[2,2],[3],[4]] => ([],1) => ([],1) => 0
[[1,1,1,1,1],[2],[3]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2,2],[3]] => ([],1) => ([],1) => 0
[[1,1,1],[2,2,2],[3]] => ([],1) => ([],1) => 0
[[1,1,1],[2,2],[3,3]] => ([],1) => ([],1) => 0
[[1,1,1,1,1,1,1],[2]] => ([],1) => ([],1) => 0
[[1,1,1,1,1,1],[2,2]] => ([],1) => ([],1) => 0
[[1,1,1,1,1],[2,2,2]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2,2,2,2]] => ([],1) => ([],1) => 0
[[1]] => ([],1) => ([],1) => 0
[[1,1,1,1],[2,2,2],[3,3],[4]] => ([],1) => ([],1) => 0
[[1,1,1,1,1],[2,2,2,2],[3,3,3],[4,4],[5]] => ([],1) => ([],1) => 0
[[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]] => ([],1) => ([],1) => 0
[[1,1]] => ([],1) => ([],1) => 0
[[1,1,1]] => ([],1) => ([],1) => 0
[[1,1,1,1]] => ([],1) => ([],1) => 0
[[1,1,1,1,1]] => ([],1) => ([],1) => 0
[[1],[2],[3],[4],[5],[6]] => ([],1) => ([],1) => 0
search for individual values
searching the database for the individual values of this statistic
Description
The diameter of a connected graph.
This is the greatest distance between any pair of vertices.
This is the greatest distance between any pair of vertices.
Map
subcrystal
Description
The underlying poset of the subcrystal obtained by applying the raising operators to a semistandard tableau.
Map
incomparability graph
Description
The incomparability graph of a poset.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!