On the Minimum Order of Graphs with Given Group
Canadian mathematical bulletin, Tome 17 (1974) no. 4, pp. 467-470
Voir la notice de l'article provenant de la source Cambridge
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).
Babai, László. On the Minimum Order of Graphs with Given Group. Canadian mathematical bulletin, Tome 17 (1974) no. 4, pp. 467-470. doi: 10.4153/CMB-1974-082-9
@article{10_4153_CMB_1974_082_9,
author = {Babai, L\'aszl\'o},
title = {On the {Minimum} {Order} of {Graphs} with {Given} {Group}},
journal = {Canadian mathematical bulletin},
pages = {467--470},
year = {1974},
volume = {17},
number = {4},
doi = {10.4153/CMB-1974-082-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-082-9/}
}
Cité par Sources :