Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have attached a link to my hasse diagram I drew... Sorry about image size and rotation. Graphs

So is it correct to say a hasse diagram is just a digraph with each internal vertice removed? So would my diagram A be a digraph not a hasse diagram? The book gave us a hasse diagram which I copied under B there which has a intersecting vertice so that got my confused. How can I make my diagram in A work?

My second question is about the bounds of a hasse diagram that I'm not sure about. For B.

  1) What are the upper bounds for {d,e,c} My guess is b? Not sure about this one.
  2) What are the lower bounds for {c, b} My guess is d? Since its the farthest down connected by both 
  3) What is the least upper bound for {f, c}. My guess is e? Since its in the middle but I'm not sure if its a lower bound or upper.
share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.