This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ± on S by a ± b if a  b . Draw the Hasse diagram for the partially ordered set ( S, ± ). Is ( S, ± ) a lattice? (b) Now replace S with the set { 3 a 7 b  ≤ a,b ≤ 3 } , and use the same ordering ± as in part (a). Draw the Hasse diagram for the partially ordered set ( S, ± ). Is ( S, ± ) a lattice? 6. Let G be a graph with v vertices and e edges (and suppose that v > 0). Let M be the maximum degree of the vertices of G , and let m be the minimum degree of the vertices of G . Show that (a) 2 e/v ≥ m . (b) 2 e/v ≤ M . Math 240 — Assignment 5 — Fall 2009 Marker: Benjamin Young Instructor: Benjamin Young Date: Name: Student Number:...
View
Full Document
 Spring '08
 SZABO
 Math, Partially ordered set, Hasse Diagram, aRb, nth Fibonacci number, recurrence relation ak

Click to edit the document details