Hello!

I've just learned about Hasse Diagrams.

Is this a correct Hasse Diagram for this problem, or am I missing something here?

Draw the Hasse Diagram for a Partially ordered set R over a set A, and find all the maximal and minimal elements.

A = { 1,2,3,4,5,6,7,8,9 }

R = { (a,b) from AxA | a<=b-3 or a=b }

So minimal elements would be 1,2,3 and maximal 9,8,7?

Thank you (: