{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:18:16Z","timestamp":1758824296009},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00231-0","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"103-114","source":"Crossref","is-referenced-by-count":10,"title":["Random strongly regular graphs?"],"prefix":"10.1016","volume":"273","author":[{"given":"Peter J.","family":"Cameron","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00231-0_BIB1","series-title":"Topics in Steiner Systems","first-page":"37","article-title":"Almost all Steiner triple systems are asymmetric","volume":"Vol. 7","author":"Babai","year":"1979"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0195-6698(81)80015-7","article-title":"Graphs which contain all small graphs","volume":"2","author":"Bollob\u00e1s","year":"1981","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2140\/pjm.1963.13.389","article-title":"Strongly regular graphs, partial geometries, and partially balanced designs","volume":"13","author":"Bose","year":"1963","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB4","series-title":"Theory of Groups of Finite Order","author":"Burnside","year":"1955"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB5","series-title":"The Mathematics of Paul Erd\u0151s","first-page":"331","article-title":"The random graph","author":"Cameron","year":"1996"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB6","series-title":"Permutation Groups","author":"Cameron","year":"1999"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB7","doi-asserted-by":"crossref","unstructured":"P.J. Cameron, Strongly regular graphs, in: L.W. Beineke, R.J. Wilson (Eds.), Topics in Algebraic Graph Theory, Cambridge University Press, to appear.","DOI":"10.1017\/CBO9780511623714.004"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB8","doi-asserted-by":"crossref","unstructured":"P.J. Cameron, D.S. Stark, A prolific construction of graphs with the n-e.c. property, Electron. J. Combin. 9(1) (2002) #R31 http:\/\/www.combinatorics.org.","DOI":"10.37236\/1647"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB9","series-title":"An ATLAS of Finite Groups","author":"Conway","year":"1985"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB10","first-page":"301","article-title":"New prolific constructions of strongly regular graphs","volume":"2","author":"Fon-Der-Flaass","year":"2002","journal-title":"Adv. Geom."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB11","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebskii","year":"1969","journal-title":"Kibernetika"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0095-8956(90)90128-M","article-title":"Asymptotic enumeration of Latin rectangles","volume":"48","author":"Godsil","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/(SICI)1520-6610(1996)4:6<405::AID-JCD3>3.0.CO;2-J","article-title":"Generating uniformly distributed random Latin squares","volume":"4","author":"Jacobson","year":"1996","journal-title":"J. Combin. Des."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(83)90276-5","article-title":"Exponential numbers of two-weight codes, difference sets and symmetric designs","volume":"46","author":"Kantor","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB15","unstructured":"B.D. McKay, E. Spence, in preparation; see http:\/\/www.gauss.maths.gla.ac.uk\/~ted\/srgraphs.html."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jcta.1998.2947","article-title":"Most Latin squares have many subsquares","volume":"86","author":"McKay","year":"1999","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB17","doi-asserted-by":"crossref","unstructured":"B.D. McKay, I.M. Wanless, Maximising the permanent of (0,1)-matrices and the number of extensions of Latin rectangles, Electron. J. Combin. 5 (1998) #R5 (20pp).","DOI":"10.37236\/1349"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB18","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/BF01222774","article-title":"Strongly regular graphs with least eigenvalue \u2212m","volume":"33","author":"Neumaier","year":"1979","journal-title":"Arch. Math."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0024-3795(68)90008-6","article-title":"Strongly regular graphs with (\u22121,1,0) adjacency matrix having eigenvalue 3","volume":"1","author":"Seidel","year":"1968","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB20","series-title":"Surveys in Combinatorics","first-page":"157","article-title":"Strongly regular graphs","author":"Seidel","year":"1979"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB21","first-page":"307","article-title":"Pseudo-random graphs","volume":"33","author":"Thomason","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0004972700046244","article-title":"Construction of strongly regular graphs using affine designs","volume":"4","author":"Wallis","year":"1971","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB23","series-title":"Permutation Groups through Invariant Relations and Invariant Functions","author":"Wielandt","year":"1969"},{"key":"10.1016\/S0012-365X(03)00231-0_BIB24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01215371","article-title":"Non-isomorphic Steiner triple systems","volume":"135","author":"Wilson","year":"1974","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(03)00231-0_BIB25","series-title":"Surveys in Combinatorics, 1999","first-page":"239","article-title":"Models of random regular graphs","volume":"Vol. 267","author":"Wormald","year":"1999"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T14:57:49Z","timestamp":1585148269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002310"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00231-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}