{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:30:23Z","timestamp":1775053823890,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1007\/bf02579445","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:18:25Z","timestamp":1174587505000},"page":"81-94","source":"Crossref","is-referenced-by-count":68,"title":["Component structure in the evolution of random hypergraphs"],"prefix":"10.1007","volume":"5","author":[{"given":"Jeanette","family":"Schmidt-Pruzan","sequence":"first","affiliation":[]},{"given":"Eli","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579445_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s andE. Szemer\u00e9di, The longest path in a random graph,Combinatorica,1 (1981), 1\u201312.","journal-title":"Combinatorica"},{"key":"BF02579445_CR2","volume-title":"Graphes et Hypergraphes","author":"C. Berge","year":"1970","unstructured":"C. Berge,Graphes et Hypergraphes, Dunod, Paris, (1970)."},{"key":"BF02579445_CR3","unstructured":"C. Berge,Introduction \u00e0 la Theorie des Hypergraphes, Le presse de l\u2019Universit\u00e9 de Montr\u00e9al, Seminaire de Math. Superieur, \u00e9t\u00e9 1971."},{"key":"BF02579445_CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s andP. Erd\u0151s, Cliques in random graphs,Math. Proc. Camb. Phil. Soc.,80 (1976), 419\u2013427.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"BF02579445_CR5","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s andA. R\u00e9nyi, On the evolution of random graphs,Publ. of the Math. Inst. of the Hung. Acad. Sci.,5 (1960), 17\u201361.","journal-title":"Publ. of the Math. Inst. of the Hung. Acad. Sci."},{"key":"BF02579445_CR6","volume-title":"The Art of Counting","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s,The Art of Counting, Selected Writings, MIT Press, Cambridge\/Massachusetts and London\/England, 1973."},{"key":"BF02579445_CR7","volume-title":"Probabilistic Methods in Combinatorics","author":"P. Erd\u0151s","year":"1974","unstructured":"P. Erd\u0151s andJ. Spencer,Probabilistic Methods in Combinatorics. Academic Press, New York, 1974."},{"key":"BF02579445_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(82)90130-3","volume":"40","author":"W. Fernandez de la Vega","year":"1982","unstructured":"W. Fernandez de la Vega, Sur la cardinalit\u00e9 maximum des couplages d\u2019hypergraphes al\u00e9atoire uniformes,Discrete Math. 40, (1982), 315\u2013318.","journal-title":"Discrete Math."},{"key":"BF02579445_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0012-365X(83)90044-4","volume":"45","author":"J. Schmidt","year":"1983","unstructured":"J. Schmidt andE. Shamir, A threshold for perfect matchings ind-pure random hypergraphs,Discrete Math.,45 (1983), 287\u2013295.","journal-title":"Discrete Math."},{"key":"BF02579445_CR10","unstructured":"J. Schmidt-Pruzan, E. Shamir, andE. Upfal, Random hypergraph coloring algorithms and the weak chromatic number,Journal of Graph Theory (to appear), (Preliminary version: Technical Report (CS83-09) Dept. Appl. Math. Weizmann Inst. of Sc. Rehovot Israel)."},{"key":"BF02579445_CR11","unstructured":"J. Schmidt-Pruzan, Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number.Submitted to Discrete Math., (Preliminary version: Technical Report (CS83-10) Dept. Appl. Math. Weizmann Inst. of Sc. Rehovot Israel)."},{"key":"BF02579445_CR12","unstructured":"I. Tomescu, Asymptotical estimations for the number of cliques of uniform hypergraphs,Annals of Discrete Math.,11,Studies on graphs and Discrete Programming (1981), (Edited by P. Hansen), North-Holland Publishing Comp., 345\u2013358."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579445.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579445\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:04Z","timestamp":1558183504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["BF02579445"],"URL":"https:\/\/doi.org\/10.1007\/bf02579445","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}