{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T16:33:22Z","timestamp":1777307602349,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"DOI":"10.1007\/bf01200906","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:38:30Z","timestamp":1108741110000},"page":"173-213","source":"Crossref","is-referenced-by-count":75,"title":["OnK 4-free subgraphs of random graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Y.","family":"Kohayakawa","sequence":"first","affiliation":[]},{"given":"T.","family":"\u0141uczak","sequence":"additional","affiliation":[]},{"given":"V.","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01200906_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/jgt.3190140511","volume":"14","author":"L. Babai","year":"1990","unstructured":"L. Babai, M. Simonovits, J. H. Spencer: Extremal subgraphs of random graphs,J. Graph Theory,14 (1990), 599\u2013622.","journal-title":"J. Graph Theory"},{"key":"BF01200906_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s:Extremal Graph Theory, Academic Press, London, 1978."},{"key":"BF01200906_CR3","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s:Random Graphs, Academic Press, London, 1985."},{"key":"BF01200906_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/jgt.3190160311","volume":"16","author":"F. R. K. Chung","year":"1992","unstructured":"F. R. K. Chung: Subgraphs of a hypercube containing no small even cycles,J. Graphs Theory,16 (1992), 273\u2013286.","journal-title":"J. Graphs Theory"},{"key":"BF01200906_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01788087","volume":"2","author":"P. Frankl","year":"1986","unstructured":"P. Frankl, V. R\u00f6dl: Large triangle-free subgraphs in graphs withoutK 4,Graphs and Combinatorics,2 (1986), 135\u2013244.","journal-title":"Graphs and Combinatorics"},{"key":"BF01200906_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0012-365X(94)90287-9","volume":"126","author":"Z. F\u00fcredi","year":"1994","unstructured":"Z. F\u00fcredi: Random Ramsey graphs for the four-cycle,Discrete Maths.,126 (1994), 407\u2013410.","journal-title":"Discrete Maths."},{"key":"BF01200906_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S0963548300001619","volume":"4","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, T. \u0141uczak: The induced size-Ramsey number of cycles,Combinatorics, Probability, and Computing,4 (1995), 217\u2013239.","journal-title":"Combinatorics, Probability, and Computing"},{"key":"BF01200906_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01300129","volume":"16","author":"P. E. Haxell","year":"1996","unstructured":"P. E. Haxell, Y. Kohayakawa, T. \u0141uczak: Tur\u00e1n's extremal problem in random graphs: forbidding odd cycles,Combinatorica,16 (1996), 107\u2013122.","journal-title":"Combinatorica"},{"key":"BF01200906_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jctb.1995.1035","volume":"64","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, T. \u0141uczak: Tur\u00e1n's extremal problem in random graphs: forbidding even cycles.J. Combin. Theory, Ser. B.,64 (1995), 273\u2013287.","journal-title":"J. Combin. Theory, Ser. B."},{"key":"BF01200906_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"S. Janson: Poisson approximation for large deviations,Random Structures and Algorithms,1 (1990), 221\u2013230.","journal-title":"Random Structures and Algorithms"},{"key":"BF01200906_CR11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-642-60539-0_16","volume-title":"Foundations of Computational Mathematics","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa: Szemer\u00e9di's regularity lemma for sparse graphs, in:Foundations of Computational Mathematics (eds.: F. Cucker, M. Shub), 1997, Berlin, Heidelberg, Springer-Verlag, 216\u2013230."},{"key":"BF01200906_CR12","unstructured":"Y. Kohayakawa, B. Kreuter, A. Steger: An extremal problem for random graphs and the number of graphs with large even-girth, (1995) submitted."},{"key":"BF01200906_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/aa-75-2-133-163","volume":"LXXV","author":"Y. Kohayakawa","year":"1996","unstructured":"Y. Kohayakawa, T. \u0141uczak, V. R\u00f6dl: Arithmetic progressions of length three in subsets of a random set,Acta Arithmetica,LXXV (1996), 133\u2013163.","journal-title":"Acta Arithmetica"},{"key":"BF01200906_CR14","first-page":"317","volume-title":"Combinatorics\u2014Paul Erd\u0151s is Eighty","author":"P. R\u00f6dl","year":"1993","unstructured":"P. R\u00f6dl, A. Ruci\u0144ski: Lower bounds on probability thresholds for Ramsey properties, in:Combinatorics\u2014Paul Erd\u0151s is Eighty (Volume 1) (eds.: D. Mikl\u00f3s, V. T. S\u00f3s, T. Sz\u0151nyi), Budapest, Bolyai Soc. Math. Studies, 1993, 317\u2013346."},{"key":"BF01200906_CR15","doi-asserted-by":"crossref","first-page":"917","DOI":"10.2307\/2152833","volume":"8","author":"V. R\u00f6dl","year":"1995","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski: Threshold functions for Ramsey properties,J. Amer. Math Soc.,8 (1995), 917\u2013942.","journal-title":"J. Amer. Math Soc."},{"key":"BF01200906_CR16","first-page":"399","volume-title":"Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Proc. Colloque Inter. CNRS","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in:Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Proc. Colloque Inter. CNRS (eds.: J.-C. Bermond, J.-C., Fournier, M. Las Vergnas, D. Sotteau), CNRS, Paris, 1978, 399\u2013401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200906\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:58:28Z","timestamp":1556729908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF01200906"],"URL":"https:\/\/doi.org\/10.1007\/bf01200906","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}