52 citations · 130 across the 20 of their papers we have counts for
1 paper · 1 filter
Amin Coja-Oghlan, Charilaos Efthymiou
The independence number of a sparse random graph G(n,m) of average degree d=2m/n is well-known to be α(G(n,m))~2n ln(d)/d with high probability. Moreover, a trivial greedy algorith…