\(\delta\)-connectivity in random lifts of graphs (Q521368)

Summary: \textit{A. Amit} and \textit{N. Linial} [Comb. Probab. Comput. 15, No. 3, 317--332 (2006; Zbl 1095.05034)] have shown that a random lift of a connected graph with minimum degree \(\delta\geq 3\) is asymptotically almost surely (a.a.s.) \(\delta\)-connected and mentioned the problem of estimating this probability as a function of the degree of the lift. Using a connection between a random \(n\)-lift of a graph and a randomly generated subgroup of the symmetric group on \(n\)-elements, we show that this probability is at least \(1-O\left(\frac{1}{n^{\gamma(\delta)}}\right)\) where \(\gamma(\delta)>0\) for \(\delta\geq 5\) and it is strictly increasing with \(\delta\). We extend this to show that one may allow \(\delta\) to grow slowly as a function of the degree of the lift and the number of vertices and still obtain that random lifts are a.a.s. \(\delta\)-connected. We also simplify a later result showing a lower bound on the edge expansion of random lifts. On a related note, we calculate the probability that a subgroup of a wreath product of symmetric groups generated by random generators is transitive, extending a well known result of \textit{J. Dixon} [Electron. J. Comb. 12, No. 1, Research paper R56, 5 p. (2005; Zbl 1086.20045)] which covers the case for subgroups of the symmetric group.