Let C be a conjugacy class in the alternating group An, and let supp(C) be the number of nonfixed digits under the action of a permutation in C. For every 1 > δ > 0 and n ≥5 there exists a constant c = c(δ) > 0 such that if supp(C) ≥ δn then the undirected Cayley graph X(An, C) is a c expander. A family of such Cayley graphs with supp(C) = o(√n) is not a family of c-expanders. For every δ > 0, if supp(C) ≥ √3n then sets of vertices of order at most (1/2 - δ)(n - (n/supp(C)))! in X(An, C) expand. The proof of the last result combines spectral and representation theory techniques with direct combinatorial arguments. © 1997 Academic Press.
CITATION STYLE
Roichman, Y. (1997). Expansion properties of Cayley graphs of the alternating groups. Journal of Combinatorial Theory. Series A, 79(2), 281–297. https://doi.org/10.1006/jcta.1997.2786
Mendeley helps you to discover research relevant for your work.