For large n, what's the threshold for erdos-renyi graphs having diameter 2? a result in terms of either the G(n, p) or G(n, M) model would be welcome.
up
>homework thread
>>158763432 what?
>>15876343I have no idea what the fuck this is, but if it's a normalized distribution, you'd expect a radius of 1 which gives a diameter of 2.
About three fiddy.
>>15878300Not how graph radii work.
>>15878790How do they work?
>>15880658Without looking it up, one is the maximum of the maximum distance and the other is the minimum of the maximum distance. I assume the former is diameter and the latter is radius.Here's the wiki article, which tells me I'm righthttps://en.wikipedia.org/wiki/Distance_(graph_theory)#Related_concepts