This preview shows page 1. Sign up to view the full content.
Unformatted text preview: a vertex with degree d . Then the sum of degrees is at least 1 ( d1)+2 ( nd )+ d = 2 n1, Since the sum of degrees is twice the number of edges, the number of edges is at least d (2 n1) / 2 e = n > n1, a contradiction. 13) (a) 4 7 , 4 7 (b) 2 3 , 1 2 14) This is one of the problems in the last homework. 15) 1 1000 99 100 1 1000 99 100 + 999 1000 1 100 = 11 122 9 . 02% 1...
View
Full
Document
This note was uploaded on 12/15/2008 for the course CSE cse 21 taught by Professor Graham during the Spring '08 term at UCSD.
 Spring '08
 Graham

Click to edit the document details