{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:39:16Z","timestamp":1772372356536,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T00:00:00Z","timestamp":1048550400000},"content-version":"vor","delay-in-days":5076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90087-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"167-215","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":61,"title":["The first cycles in an evolving graph"],"prefix":"10.1016","volume":"75","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Donald E.","family":"Knuth","sequence":"additional","affiliation":[]},{"given":"Boris","family":"Pittel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90087-3_BIB1","series-title":"Handbook of Mathematical functions","author":"Abramowitz","year":"1964"},{"key":"10.1016\/0012-365X(89)90087-3_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(89)90087-3_BIB3","unstructured":"B. Bollob\u00e1s, Concentration of measure phenomena in the theory of random graphs, in Annals of Discrete Mathematics, Proceedings of Random Graphs '87, to appear."},{"key":"10.1016\/0012-365X(89)90087-3_BIB4","series-title":"Asymptotic Methods in Analysis","author":"de Bruijn","year":"1958"},{"key":"10.1016\/0012-365X(89)90087-3_BIB5","series-title":"Tomes I et II","article-title":"Analyse Combinatoire","author":"Comtet","year":"1970"},{"key":"10.1016\/0012-365X(89)90087-3_BIB6_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs, I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0012-365X(89)90087-3_BIB6_2","series-title":"The Art of Counting","first-page":"561","article-title":"On random graphs, I","author":"Erd\u0151s","year":"1973"},{"key":"10.1016\/0012-365X(89)90087-3_BIB7_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u0151zl."},{"key":"10.1016\/0012-365X(89)90087-3_BIB7_2","series-title":"The Art of Counting","first-page":"574","article-title":"On the evolution of random graphs","author":"Erd\u0151s","year":"1973"},{"key":"10.1016\/0012-365X(89)90087-3_BIB8","series-title":"Combinatorial Enumeration","author":"Goulden","year":"1983"},{"key":"10.1016\/0012-365X(89)90087-3_BIB9","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0012-365X(89)90087-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-4149(87)90048-2","article-title":"Poisson convergence and Poisson processes with applications to random graphs","volume":"26","author":"Janson","year":"1987","journal-title":"Stochastic Processes and their Applications"},{"key":"10.1016\/0012-365X(89)90087-3_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","article-title":"The expected linearity of a simple equivalence algorithm","volume":"6","author":"Knuth","year":"1978","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0012-365X(89)90087-3_BIB12","series-title":"Graphical Evolution","author":"Palmer","year":"1985"},{"key":"10.1016\/0012-365X(89)90087-3_BIB13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9947-1988-0957061-X","article-title":"On a random graph with a subcritical number of edges","volume":"309","author":"Pittel","year":"1988","journal-title":"Transactions of the American Mathematical Society"},{"key":"10.1016\/0012-365X(89)90087-3_BIB14","series-title":"Aufgaben und Lehrs\u00e4tze aus der Analysis","author":"P\u00f3lya","year":"1925"},{"key":"10.1016\/0012-365X(89)90087-3_BIB15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/jgt.3190010407","article-title":"The number of connected sparsely edged graphs","volume":"1","author":"Wright","year":"1977","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900873?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900873?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:05:10Z","timestamp":1734080710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89900873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89900873"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90087-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The first cycles in an evolving graph","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(89)90087-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}