Most primitive groups are full automorphism groups of edge-transitive hypergraphs
MetadataShow full item record
We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞. So the property of the title holds for all primitive groups except the alternating groups and finitely many others. This answers a question of M.H. Klin. Moreover, we give an upper bound n1/2+ε for the minimum size of the edges in such a hypergraph. This is essentially best possible.
Babai , L & Cameron , P J 2015 , ' Most primitive groups are full automorphism groups of edge-transitive hypergraphs ' , Journal of Algebra , vol. 421 , pp. 512-523 . https://doi.org/10.1016/j.jalgebra.2014.09.002
Journal of Algebra
Copyright © 2014. the Author(s). This is the preprint version before acceptance of the following article: Most primitive groups are full automorphism groups of edge-transitive hypergraphs, Babai, L. & Cameron, P. J. 1 Jan 2015 In : Journal of Algebra. 421, 1, p. 512-523, which has been published in final form at http://www.sciencedirect.com/science/article/pii/S002186931400489X
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.