Minimal generation of transitive permutation groups

This paper discusses upper bounds on the minimal number of elements d(G) required to generate a transitive permutation group G, in terms of its degree n, and its order |G|. In particular, we reduce a conjecture of L. Pyber on the number of subgroups of the symmetric group Sym(n). We also prove that our bounds are best possible.