For a complete graph, the size of minimum vertex cover is $n-1$.
I was wondering whether there exist an upper bound (or an expected value or upper bound) for the size of minimum vertex cover for scale-free graphs, i.e. such whose degree distribution follows a power law.
I searched and didn't find anything, is anybody aware of any bounds?