Looking for trustworthy answers? Westonci.ca is the ultimate Q&A platform where experts share their knowledge on various topics. Get detailed and accurate answers to your questions from a community of experts on our comprehensive Q&A platform. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform.

Show that, for constant p∈ (0,1), almost every graph in G(n,p) has diameter 2.