returns a Hasse diagram of the partially ordered set on set partitions of through in which if is finer than , that is, each block in is contained in some block in .
- To use , you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- The function takes two options: and VertexLabel, with default values Undirected and False, respectively.
- When is set to Directed, the function produces the underlying directed acyclic graph.
- When VertexLabel is set to True, labels are produced for the vertices.