SOLUTION: Consider the random graph G(n,p) on n vertices, where the probability of an edge between any two vertices in the graph is p. Now, consider the random graph G(n,1/2), Then : HINT :

Question 1042954: Consider the random graph G(n,p) on n vertices, where the probability of an edge between any two vertices in the graph is p. Now, consider the random graph G(n,1/2), Then : HINT : n−12≈n/2, and do use one of the bounds.
a) Almost all random graphs have minimum degree d=(n2−n−√lnn).
b) Almost all nodes have degree concentrated in the range ((n2−3n/2−−−−√lnn,n2+3n/2−−−−√lnn).
3) Almost all random graphs (assume connected) have diameter ≥2.
4) All of the above.

Answer by ikleyn(52814) (Show Source): You can put this solution on YOUR website!
.
Any relation to the school math and any relation to the purposes of this site.

RELATED QUESTIONS
Consider the random graph G(n,p) on n vertices, where the probability of an edge between... (answered by ikleyn)

Consider the random graph G(n,p) on n vertices, where the probability of an edge between... (answered by ikleyn)

What is the cover time of a complete graph on n vertices (i.e., a graph on n vertices... (answered by ikleyn)

Consider a regular n-gon, with all of its diagonals, where n > 4. A triangle in the... (answered by richard1234)

(1) f and g are functions on X={1,2,3} as f�{(1,2); (2,3); (3,1)) ; g=(1,2); (2,1);... (answered by ikleyn)

I need to figure out how can I solve this problems? can any body help to me or any idea?... (answered by stanbon)

Suppose p=logn(g). Define an exponential relationship between p,n, and g. n is the base... (answered by ikleyn,stanbon)

Two of the vertices of a regular octahedron are to be chosen at random. What is the... (answered by greenestamps)

Ten points in the plane are given, with no three collinear. Four distinct segments... (answered by CPhill)