30 Apr
2015
30 Apr
'15
9:28 a.m.
The average degree of the graph, for n-digit primes, should be 9n/(n log(10)) = 3.9 — more than enough for a random graph to have a giant component. I’ve checked it for n=5. -Veit
On Apr 30, 2015, at 8:09 AM, James Propp <jamespropp@gmail.com> wrote:
Can anyone give a heuristic argument (based on the density of the primes and their approximate independence from one another) that the property ought to hold for all sufficiently large n?