{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T23:52:00Z","timestamp":1784591520001,"version":"3.55.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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":[[1998,2]]},"DOI":"10.1016\/s0012-365x(97)00115-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:38Z","timestamp":1027604198000},"page":"185-209","source":"Crossref","is-referenced-by-count":26,"title":["Largest component in random combinatorial structures"],"prefix":"10.1016","volume":"180","author":[{"given":"Xavier","family":"Gourdon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00115-5_bib1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.2140\/pjm.1982.103.269","article-title":"Random mappings with constraints on coalescence and number of origins","volume":"103","author":"Arney","year":"1982","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib2","first-page":"2","article-title":"On the number of positive integers \u2a7dx and free of prime factors > y","volume":"13","author":"DeBruijn","year":"1951","journal-title":"Indag. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S1385-7258(66)50029-4","article-title":"On the number of positive integers \u2a7dx and free of prime factors > y","volume":"28","author":"DeBruijn","year":"1966","journal-title":"Indag. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib4","first-page":"1","article-title":"On the frequency of numbers containing prime factors of a certain relative magnitude","volume":"22","author":"Dickman","year":"1930","journal-title":"Ark. Mat. Astr. Fys."},{"key":"10.1016\/S0012-365X(97)00115-5_bib5","volume":"vol. 2","author":"Feller","year":"1971"},{"issue":"1\u20132","key":"10.1016\/S0012-365X(97)00115-5_bib6","first-page":"3","article-title":"Mellin transforms and asymptotics: harmonic sums","volume":"144","author":"Flajolet","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(97)00115-5_bib7","series-title":"Advances in Cryptology, Proc. Eurocrypt'89 Houtalen","first-page":"329","article-title":"Random mapping statistics","volume":"vol. 434","author":"Flajolet","year":"1990"},{"issue":"2","key":"10.1016\/S0012-365X(97)00115-5_bib8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/S0012-365X(97)00115-5_bib9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(91)90145-R","article-title":"Automatic average-case analysis of algorithms","volume":"79","author":"Flajolet","year":"1991","journal-title":"Theoret. Comput. Sci. Ser. A."},{"issue":"1","key":"10.1016\/S0012-365X(97)00115-5_bib10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1137\/0404006","article-title":"The cycle construction","volume":"4","author":"Flajolet","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(93)90364-Y","article-title":"General combinatorial schemas: gaussian limit distributions and exponential tails","volume":"114","author":"Flajolet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib12","series-title":"Random subgraphs of the n-cycle, Discrete Math.","author":"Gourdon","year":"1995"},{"issue":"1","key":"10.1016\/S0012-365X(97)00115-5_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","article-title":"Une Theorie combinatoire des series formelles","volume":"42","author":"Joyal","year":"1981","journal-title":"Adv. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S1385-7258(78)80014-6","article-title":"The average time for carry propagation","volume":"40","author":"Knuth","year":"1978","journal-title":"Indag. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib15","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","article-title":"On the altitude of modes in random trees","volume":"30","author":"Meir","year":"1978","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02579158","article-title":"On random mapping patterns","volume":"4","author":"Meir","year":"1984","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0012-365X(97)00115-5_bib17","doi-asserted-by":"crossref","first-page":"583","DOI":"10.2307\/1969046","article-title":"The number of trees","volume":"49","author":"Otter","year":"1948","journal-title":"Ann. Math."},{"key":"10.1016\/S0012-365X(97)00115-5_bib18","first-page":"429","article-title":"How easy is collision search? Application to DES","volume":"vol. 434","author":"Quisquater","year":"1989"},{"key":"10.1016\/S0012-365X(97)00115-5_bib19","series-title":"Proc. 1978 Internat. Congr. Mathematicians","article-title":"Strong theorems in coin tossing","author":"R\u00e9v\u00e9sz","year":"1980"},{"key":"10.1016\/S0012-365X(97)00115-5_bib20","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1090\/S0002-9947-1966-0195117-8","article-title":"Ordered cycle lengths in a random permutation","volume":"121","author":"Shepp","year":"1966","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00115-5_bib21","article-title":"M\u00e9thodes d'analyse pour les constructions combinatoires et les algorithmes","author":"Soria-Cousineau","year":"1990","journal-title":"Doctorat d'\u00e9tat, Universit\u00e9 de Paris-Sud, Orsay"},{"key":"10.1016\/S0012-365X(97)00115-5_bib22","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/1114078","article-title":"Limit distributions of certain characteristics of random mapping","volume":"14","author":"Stepanov","year":"1969","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001155?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:21Z","timestamp":1556117481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0012365X97001155"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00115-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}