{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:49Z","timestamp":1725543109506},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_37","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"350-359","source":"Crossref","is-referenced-by-count":3,"title":["Creation and Growth of Components in a Random Hypergraph Process"],"prefix":"10.1007","author":[{"given":"Vlady","family":"Ravelomanana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alphonse Laza","family":"Rijamamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Andriamampianina, T., Ravelomanana, V.: Enumeration of connected uniform hypergraphs. In: Proc. of the 17-th Formal Power Series and Algebraic Combinatorics (2005)"},{"key":"37_CR2","unstructured":"Berge, C.: Graphs and hypergraphs, North-Holland Mathematical Library (1976)"},{"key":"37_CR3","volume-title":"Encyclopedia of Mathematics and its Applications","author":"F. Bergeron","year":"1998","unstructured":"Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-like Structures. In: Encyclopedia of Mathematics and its Applications, vol.\u00a067. Cambridge Univ. Press, Cambridge (1998)"},{"key":"37_CR4","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, London (1985)"},{"key":"37_CR5","volume-title":"Asymptotic Methods in Analysis","author":"N.G. Bruijn De","year":"1981","unstructured":"De Bruijn, N.G.: Asymptotic Methods in Analysis. Dover, New York (1981)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Moore, C., Sanwalani, V.: Counting Connected Graphs and Hypergraphs via the Probabilistic Method. In: Proc. of APPROX-RANDOM 2004 (2004)","DOI":"10.1007\/978-3-540-27821-4_29"},{"key":"37_CR7","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics (chapters are avalaible as Inria research reports) (to appear), See: \n                      \n                        http:\/\/algo.inria.fr\/flajolet\/Publications\/books.html"},{"key":"37_CR8","volume-title":"Graphical Enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F., Palmer, E.: Graphical Enumeration. Academic Press, New York (1973)"},{"key":"37_CR9","unstructured":"Wilf, H.S.: Generatingfunctionology"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/rsa.3240040105","volume":"4","author":"S. Janson","year":"1993","unstructured":"Janson, S.: Multicyclic components in random graphs process. Random Structures and Algorithms\u00a04, 71\u201384 (1993)","journal-title":"Random Structures and Algorithms"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<343::AID-RSA8>3.0.CO;2-D","volume":"17","author":"S. Janson","year":"2000","unstructured":"Janson, S.: Growth of components in random graphs. Random Structures and Algorithms\u00a017, 343\u2013356 (2000)","journal-title":"Random Structures and Algorithms"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/rsa.3240040303","volume":"4","author":"S. Janson","year":"1993","unstructured":"Janson, S., Knuth, D.E., \u0141uczak, T., Pittel, B.: The birth of the giant component. Random Structures and Algorithms\u00a04, 233\u2013358 (1993)","journal-title":"Random Structures and Algorithms"},{"key":"37_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random Graphs. John Wiley, New York (2000)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0012-365X(96)00076-3","volume":"171","author":"M. Karo\u0144ski","year":"1997","unstructured":"Karo\u0144ski, M., \u0141uczak, T.: The number of sparsely edges connected uniform hypergraphs. Discrete Math.\u00a0171, 153\u2013168 (1997)","journal-title":"Discrete Math."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0377-0427(01)00464-2","volume":"142","author":"M. Karo\u0144ski","year":"2002","unstructured":"Karo\u0144ski, M., \u0141uczak, T.: The phase transition in a random hypergraph. J. Comput. Appl. Math.\u00a0142, 125\u2013135 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.2307\/2046947","volume":"105","author":"D.E. Knuth","year":"1989","unstructured":"Knuth, D.E., Pittel, B.: A recurrence related to trees. Proc. Am. Math. Soc.\u00a0105, 335\u2013349 (1989)","journal-title":"Proc. Am. Math. Soc."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Ravelomanana, V.: The average size of giant components between the double-jump. Algorithmica (to appear)","DOI":"10.1007\/s00453-006-0108-6"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02579445","volume":"5","author":"J. Schmidt-Pruznan","year":"1985","unstructured":"Schmidt-Pruznan, J., Shamir, S.: Component structure in the evolution of random hypergraphs. Combinatorica\u00a05, 81\u201394 (1985)","journal-title":"Combinatorica"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/jgt.3190010407","volume":"1","author":"E.M. Wright","year":"1977","unstructured":"Wright, E.M.: The Number of Connected Sparsely Edged Graphs. Journal of Graph Theory\u00a01, 317\u2013330 (1977)","journal-title":"Journal of Graph Theory"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/jgt.3190040409","volume":"4","author":"E.M. Wright","year":"1980","unstructured":"Wright, E.M.: The Number of Connected Sparsely Edged Graphs. III. Asymptotic results. Journal of Graph Theory\u00a04, 393\u2013407 (1980)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:38Z","timestamp":1619508398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11809678_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}