This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n vertices. There is a completely diFerent approach to this enumeration problem. Use the Exponential ormula to compute the exponential generating function for labeled, connected graphs. 4 Give a probabilistic proof that as n tends to innity, the proportion of labeled graphs on n vertices which are connected tends to 1. 5 The inversion graph of the permutation of length n , denoted G , is the graph on [ n ] where i j if and only if i < j and ( i ) > ( j ). or which permutations is G a path? 6 Prove that the growth rate of Av( k 21) is ( k1) 2 . (We will discuss growth rates on Monday, 4/11.)...
View
Full
Document
 Spring '11
 Vetter

Click to edit the document details