{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T13:56:03Z","timestamp":1697550963517},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00076-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"153-167","source":"Crossref","is-referenced-by-count":16,"title":["The number of connected sparsely edged uniform hypergraphs"],"prefix":"10.1016","volume":"171","author":[{"given":"Michakl","family":"Karo\u0144ski","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"kLuczak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00076-3_BIB1","first-page":"3","article-title":"Slucha\u01d0nye grafy so stepen'\u0131u sv\u0131aznosti 2","volume":"22","author":"Bagaev","year":"1973","journal-title":"Diskretnyi Analiz"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/rsa.3240010202","article-title":"The asymptotic number of labeled connected graphs with a given number of vertices and edges","volume":"1","author":"Bender","year":"1990","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB3","series-title":"Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf.","first-page":"35","article-title":"The evolution of sparse graphs","author":"Bollob\u00e1s","year":"1984"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.2307\/1999405","article-title":"The evolution of random graphs","volume":"286","author":"Bollob\u00e1s","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(96)00076-3_BIB5","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/rsa.3240040303","article-title":"The birth of the giant component","volume":"4","author":"Janson","year":"1993","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1214\/aoms\/1177728496","article-title":"Probability of indecomposability of a random mapping","volume":"26","author":"Katz","year":"1955","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0012-365X(96)00076-3_BIB8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/rsa.3240010203","article-title":"On the number of sparse connected graphs","volume":"1","author":"Euczak","year":"1990","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1002\/rsa.3240020405","article-title":"Cycles in a random graph near the critical point","volume":"2","author":"Euczak","year":"1991","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB10","first-page":"721","article-title":"The structure of the random graph at the double-jump threshold","volume":"341","author":"Euczak","year":"1994","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(96)00076-3_BIB11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02122682","article-title":"The chromatic number of random graphs at the double-jump threshold","volume":"9","author":"Euczak","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB12","first-page":"385","article-title":"On connected graphs I","volume":"4","author":"R\u00e9nyi","year":"1959","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB13","first-page":"60","article-title":"Perechislenie odnorodnykh hipergrafov c prosto\u01d0 ciklovo\u01d0 strukturo\u01d0","volume":"2","author":"Selivanov","year":"1972","journal-title":"Kombinatorny\u00ef Analiz"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/jgt.3190010407","article-title":"The number of connected sparsely edges graphs. II. Smooth graphs and blocks","volume":"1","author":"Wright","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.3190020403","article-title":"The number of connected sparsely edges graphs. II. Smooth graphs and blocks","volume":"2","author":"Wright","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00076-3_BIB16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jgt.3190040409","article-title":"The number of connected sparsely edges graphs. III. Asymptotic results","volume":"4","author":"Wright","year":"1980","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000763?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000763?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:28:24Z","timestamp":1556116104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96000763"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00076-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}