{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T05:52:31Z","timestamp":1711000351599},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1006\/jcta.1997.2785","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T13:38:25Z","timestamp":1032356305000},"page":"1-33","source":"Crossref","is-referenced-by-count":22,"title":["Ramsey Properties of Random Hypergraphs"],"prefix":"10.1006","volume":"81","author":[{"given":"Vojtech","family":"R\u00f6dl","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcta.1997.2785_TA972785RF1","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1006\/jagm.1994.1005","article-title":"The algorithmic aspects of the regularity lemma","volume":"16","author":"Alon","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1006\/jcta.1997.2785_TA972785RF2","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1006\/jcta.1997.2785_TA972785RF3","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/S0097539793247634","article-title":"A fast approximation algorithm for computing the frequencies of subgraphs of a given graph","volume":"2493","author":"Duke","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jcta.1997.2785_TA972785RF4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","article-title":"Some remarks on the theory of graphs","volume":"53","author":"Erd\u0151s","year":"1947","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1006\/jcta.1997.2785_TA972785RF5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01788087","article-title":"Large triangle-free subgraphs in graphs withoutK4","volume":"2","author":"Frankl","year":"1986","journal-title":"Graphs and Combin."},{"key":"10.1006\/jcta.1997.2785_TA972785RF6","unstructured":"P. Frankl, V. R\u00f6dl, Extremal problems for set systems"},{"key":"10.1006\/jcta.1997.2785_TA972785RF7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/rsa.3240010209","article-title":"Poisson approximation for large deviations","volume":"1","author":"Janson","year":"1990","journal-title":"Random Struct. Algorithms"},{"key":"10.1006\/jcta.1997.2785_TA972785RF8","series-title":"Proceedings of Random Graphs' 87","article-title":"An exponential bound for the probability of nonexistence of a specified subgraph of a random graph","author":"Janson","year":"1990"},{"key":"10.1006\/jcta.1997.2785_TA972785RF9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0095-8956(92)90006-J","article-title":"Ramsey properties of random graphs","volume":"56","author":"\u0141uczak","year":"1992","journal-title":"J. Combin. Theory Ser."},{"key":"10.1006\/jcta.1997.2785_TA972785RF10","series-title":"Combinatorics, Paul Erd\u0151s Is Eighty, Keszthely, Hungary","article-title":"Lower bounds on probability thresholds for Ramsey properties","volume":"1","author":"R\u00f6dl","year":"1993"},{"key":"10.1006\/jcta.1997.2785_TA972785RF11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/rsa.3240050202","article-title":"Random graphs with monochromatic triangles in every edge coloring","volume":"5","author":"R\u00f6dl","year":"1994","journal-title":"Random Struct. Algorithms"},{"key":"10.1006\/jcta.1997.2785_TA972785RF12","doi-asserted-by":"crossref","first-page":"917","DOI":"10.2307\/2152833","article-title":"Threshold functions for Ramsey properties","volume":"8","author":"R\u00f6dl","year":"1995","journal-title":"J. Amer. Math. Soc."},{"key":"10.1006\/jcta.1997.2785_TA972785RF13","unstructured":"J. Spencer, spring 1993"},{"key":"10.1006\/jcta.1997.2785_TA972785RF14","series-title":"Problems combin. et th\u00e9orie des graphes","article-title":"Partitions of graphs","volume":"260","author":"Szemer\u00e9di","year":"1978"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316597927850?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316597927850?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T07:53:09Z","timestamp":1557388389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316597927850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0097316597927850"],"URL":"https:\/\/doi.org\/10.1006\/jcta.1997.2785","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}