On the independence number of random cubic graphs

Abstract: "We show that as n -> [infinity], the independence number ╬▒(G), for almost all 3-regular graphs G on n vertices, is at least (6 log(3/2) - 2-[epsilon])n, for any constant [epsilon] > 0. We prove this by analyzing a greedy algorithm for finding independent sets."