Linked from

The 9 pages that link to Hasse diagram, each with the reason it gives.

• Partial orderRelated: It omits reflexive and transitive edges to expose the order's structure.

• Partially ordered setRelated: It displays the order while suppressing comparisons implied by chains.

• Strict partial orderRelated: Its reduced edges display the order's immediate precedence relations.

• Antisymmetric relationRelated: Antisymmetry helps ensure the order has no cycles between distinct elements.

• AntichainRelated: In a Hasse diagram, antichains appear as sets of mutually unconnected elements.

• Maximal elementRelated: Maximal elements appear as vertices with no upward path to a larger element.

• Helmut HasseCompared with: Despite sharing Hasse’s name, this diagram is not part of his number-theoretic program.

• Order theoryRelated: It displays a finite order while omitting transitive comparisons.

• Greatest element and least elementRelated: A greatest element appears above every other vertex, and a least element below every other vertex.