# Hasse diagram

In order theory, a **Hasse diagram** (Template:IPAc-en; German: /ˈhasə/) is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set *(S, ≤)* one represents each element of *S* as a vertex in the plane and draws a line segment or curve that goes *upward* from *x* to *y* whenever *y* covers *x* (that is, whenever *x* < *y* and there is no *z* such that *x* < *z* < *y*).
These curves may cross each other but must not touch any vertices other than their endpoints. Such a diagram, with labeled vertices, uniquely determines its partial order.

Hasse diagrams are named after Helmut Hasse (1898–1979); according to Template:Harvtxt, they are so called because of the effective use Hasse made of them. However, Hasse was not the first to use these diagrams; they appear, e.g., in Template:Harvtxt. Although Hasse diagrams were originally devised as a technique for making drawings of partially ordered sets by hand, they have more recently been created automatically using graph drawing techniques.^{[1]}

The phrase "Hasse diagram" may also refer to the transitive reduction as an abstract directed acyclic graph, independently of any drawing of that graph, but this usage is eschewed here.

## A "good" Hasse diagram

Although Hasse diagrams are simple as well as intuitive tools for dealing with finite posets, it turns out to be rather difficult to draw "good" diagrams. The reason is that there will in general be many possible ways to draw a Hasse diagram for a given poset. The simple technique of just starting with the minimal elements of an order and then drawing greater elements incrementally often produces quite poor results: symmetries and internal structure of the order are easily lost.

The following example demonstrates the issue. Consider the power set of a 4-element set ordered by inclusion . Below are four different Hasse diagrams for this partial order. Each subset has a node labelled with a binary encoding that shows whether a certain element is in the subset (1) or not (0):

The first diagram makes clear that the power set is a graded poset. The second diagram has the same graded structure, but by making some edges longer than others, it emphasizes that the 4-dimensional cube is a union of two 3-dimensional cubes. The third diagram shows some of the internal symmetry of the structure. In the fourth diagram the vertices are arranged like the elements of a 4×4 matrix.

## Upward planarity

{{#invoke:main|main}}

If a partial order can be drawn as a Hasse diagram in which no two edges cross, its covering graph is said to be *upward planar*. A number of results on upward planarity and on crossing-free Hasse diagram construction are known:

- If the partial order to be drawn is a lattice, then it can be drawn without crossings if and only if it has order dimension at most two.
^{[2]}In this case, a non-crossing drawing may be found by deriving Cartesian coordinates for the elements from their positions in the two linear orders realizing the order dimension, and then rotating the drawing counterclockwise by a 45-degree angle. - If the partial order has at most one minimal element, or it has at most one maximal element, then it may be tested in linear time whether it has a non-crossing Hasse diagram.
^{[3]} - It is NP-complete to determine whether a partial order with multiple sources and sinks can be drawn as a crossing-free Hasse diagram.
^{[4]}However, finding a crossing-free Hasse diagram is fixed-parameter tractable when parametrized by the number of articulation points and triconnected components of the transitive reduction of the partial order.^{[5]} - If the
*y*-coordinates of the elements of a partial order are specified, then a crossing-free Hasse diagram respecting those coordinate assignments can be found in linear time, if such a diagram exists.^{[6]}In particular, if the input poset is a graded poset, it is possible to determine in linear time whether there is a crossing-free Hasse diagram in which the height of each vertex is proportional to its rank.

## Notes

- ↑ E.g., see Template:Harvtxt and Template:Harvtxt.
- ↑ Template:Harvtxt, Theorem 9, p. 118; Template:Harvtxt, theorem 4.1, page 18.
- ↑ Template:Harvtxt, Theorem 15, p. 125; Template:Harvtxt.
- ↑ Template:Harvtxt, Corollary 1, p. 132; Template:Harvtxt.
- ↑ Template:Harvtxt.
- ↑ Template:Harvtxt.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}. An extended preprint is available online: [1].

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.