Parial Order and Hasse Diagram
A poset or partially ordered set A is a pair, ( B, ≤ ) of a set B whose elements are called the vertices of A and obeys following rules
Hasse diagram is also called
___ elements of A are those where a ≤ c in A does not contain elements in c
If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graph is called
It is possible to have ___ maximal element and ___ minimal element.