Abstract
We show that the diameter diam(Gn) of a random labelled connected planar graph withnvertices is equal ton1/4+o(1), in probability. More precisely, there exists a constantc> 0 such that$$ P(\D(G_n)\in(n^{1/4-\e},n^{1/4+\e}))\geq 1-\exp(-n^{c\e}) $$for ε small enough andn ≥ n0(ε). We prove similar statements for 2-connected and 3-connected planar graphs and maps.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
