On the diameter of random planar graphs

From MaRDI portal



Abstract: We show that the diameter D(G_n) of a random labelled connected planar graph with n vertices is equal to n^{1/4+o(1)}, in probability. More precisely there exists a constant c>0 such that the probability that D(G_n) lies in the interval (n^{1/4-epsilon},n^{1/4+epsilon}) is greater than 1-exp(-n^{cepsilon}) for {epsilon} small enough and n>n_0(epsilon). We prove similar statements for 2-connected and 3-connected planar graphs and maps.











This page was built for publication: On the diameter of random planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959896)