6.3 Hasse diagrams of finite posets

The Hasse diagram of a finite partially ordered set (poset) involves taking the transitive reduction which eliminates "redundant" edges in the graph.

We say y covers x if (x<y) ∧ (∄z x<z<y).