{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:09:28Z","timestamp":1775578168287,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9085,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1016\/0097-3165(88)90033-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T23:49:18Z","timestamp":1107992958000},"page":"175-179","source":"Crossref","is-referenced-by-count":40,"title":["On the diameter of cayley graphs of the symmetric group"],"prefix":"10.1016","volume":"49","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[]},{"given":"\u00c1kos","family":"Seress","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(88)90033-7_BIB1","doi-asserted-by":"crossref","unstructured":"L. Babai, The probability of generating the symmetric group, J. Comb. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(89)90068-X"},{"key":"10.1016\/0097-3165(88)90033-7_BIB2","unstructured":"L. Babai and G. Hetyei, On the diameter of random Cayley graphs of the symmetric group, in preparation."},{"key":"10.1016\/0097-3165(88)90033-7_BIB3","unstructured":"L. Babai, W. M. Kantor, and A. Lubotzky, Small diameter Cayley graphs for finite simple groups, submitted."},{"key":"10.1016\/0097-3165(88)90033-7_BIB4","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"409","article-title":"Permutation groups in NC","author":"Babai","year":"1987"},{"key":"10.1016\/0097-3165(88)90033-7_BIB5","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0097-3165(87)90023-9","article-title":"On the degree of transitivity of permutation groups: A short proof","volume":"45","author":"Babai","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0097-3165(88)90033-7_BIB6","series-title":"Proceedings, 25th IEEE Symposium on Foundations of Computer Science","first-page":"229","article-title":"On the complexity of matrix group problems, I","author":"Babai","year":"1984"},{"key":"10.1016\/0097-3165(88)90033-7_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1112\/blms\/10.1.91","article-title":"The probability of generating the symmetric group","volume":"10","author":"Bovey","year":"1978","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0097-3165(88)90033-7_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01110210","article-title":"The probability of generating the symmetric group","volume":"110","author":"Dixon","year":"1969","journal-title":"Math. Z."},{"key":"10.1016\/0097-3165(88)90033-7_BIB9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0890-5401(87)90043-5","article-title":"Computing short generator sequences","volume":"72","author":"Driscoll","year":"1987","journal-title":"Information and Computation"},{"key":"10.1016\/0097-3165(88)90033-7_BIB10","series-title":"The Theory of Groups","author":"Hall","year":"1959"},{"key":"10.1016\/0097-3165(88)90033-7_BIB11","article-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"key":"10.1016\/0097-3165(88)90033-7_BIB12","volume":"Bd. I","author":"Landau","year":"1909"},{"key":"10.1016\/0097-3165(88)90033-7_BIB13","first-page":"253","article-title":"Permutations of bounded degree generate groups of polynomial diameter","volume":"19","author":"McKenzie","year":"1984"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T03:27:28Z","timestamp":1548732448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316588900337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0097316588900337"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(88)90033-7","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}