Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T07:04:50.745Z Has data issue: false hasContentIssue false

On the Minimum Order of Graphs with Given Group

Published online by Cambridge University Press:  20 November 2018

László Babai*
Affiliation:
Eötvös L. University, Budapest Hungary, Université de Montréal, Montréal Québeck
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For G a, finite group let α(G) denote the minimum number of vertices of the graphs X the automorphism group A(X) of which is isomorphic to G.

G. Sabidussi proved [1], that α(G)=0(n log d) where n=\G\ and d is the minimum number of generators of G.As 0(log n) is the best possible upper bound for d, the result established in [1] implies that α(G)=0(n log log n).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974