{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T13:27:15Z","timestamp":1776691635377,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"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":[[2007,5]]},"DOI":"10.1007\/s00493-007-2010-5","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T05:17:24Z","timestamp":1211951844000},"page":"329-365","source":"Crossref","is-referenced-by-count":8,"title":["K 4-free subgraphs of random graphs revisited"],"prefix":"10.1007","volume":"27","author":[{"given":"S.","family":"Gerke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. J.","family":"Pr\u00f6mel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Schickinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Steger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Taraz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"key":"2010_CR1","unstructured":"M. Behrisch: Random graphs without a short cycle, Master\u2019s thesis, Humboldt-Universit\u00e4t zu Berlin, 2002 (in German)."},{"key":"2010_CR2","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 Mathematics 126 (1994), 407\u2013410.","journal-title":"Discrete Mathematics"},{"key":"2010_CR3","doi-asserted-by":"crossref","unstructured":"S. Gerke, Y. Kohayakawa, V. R \u00f6dl and A. Steger: Small subsets inherit sparse \u025b-regularity, Journal of Combinatorial Theory B, accepted. http:\/\/dx.doi.org\/10.1016\/j.jctb.2006.03.004","DOI":"10.1016\/j.jctb.2006.03.004"},{"key":"2010_CR4","doi-asserted-by":"crossref","unstructured":"S. Gerke, M. Marciniszyn and A. Steger: A probabilistic counting lemma for complete graphs, in: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb\u2019 05), S. Felsner, ed., pp. 309\u2013316, DMTCS Proceedings, 2005 (extended abstract). To appear in Random Structures & Algorithms.","DOI":"10.46298\/dmtcs.3464"},{"key":"2010_CR5","doi-asserted-by":"crossref","unstructured":"S. Gerke and A. Steger: The sparse regularity lemma and its applications, in: Surveys in Combinatorics 2005, LMS, B. S. Webb, ed., LNS 327, pp. 227\u2013258, CUP, 2005.","DOI":"10.1017\/CBO9780511734885.010"},{"issue":"2","key":"2010_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/rsa.20000","volume":"24","author":"S. Gerke","year":"2004","unstructured":"S. Gerke, T. Schickinger and A. Steger: K 5-free subgraphs of random graphs, Random Structures Algorithms 24(2) (2004), 194\u2013232.","journal-title":"Random Structures Algorithms"},{"key":"2010_CR7","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 and T. \u0141uczak: Tur\u00e1n\u2019s extremal problem in random graphs: forbidding even cycles, Journal of Combinatorial Theory B 64 (1995), 273\u2013287.","journal-title":"Journal of Combinatorial Theory B"},{"issue":"1","key":"2010_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 and T. \u0141uczak: Tur\u00e1n\u2019s extremal problem in random graphs: forbidding odd cycles; Combinatorica 16(1) (1996), 107\u2013122.","journal-title":"Combinatorica"},{"key":"2010_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<245::AID-RSA3>3.0.CO;2-0","volume":"11","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa and B. Kreuter: Threshold functions for asymmetric Ramsey properties involving cycles, Random Structures & Algorithms 11 (1997), 245\u2013276.","journal-title":"Random Structures & Algorithms"},{"issue":"1","key":"2010_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/PL00009804","volume":"18","author":"Y. Kohayakawa","year":"1998","unstructured":"Y. Kohayakawa, B. Kreuter and A. Steger: An extremal problem for random graphs and the number of graphs with large even girth, Combinatorica 18(1) (1998), 101\u2013120.","journal-title":"Combinatorica"},{"issue":"2","key":"2010_CR11","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 and V. R\u00f6dl: Arithmetic progressions of length three in subsets of a random set, Acta Arithmetica LXXV.2 (1996), 133\u2013163.","journal-title":"Acta Arithmetica"},{"issue":"2","key":"2010_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01200906","volume":"17","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa, T. \u0141uczak and V. R\u00f6dl: On K 4-free subgraphs of random graphs, Combinatorica 17(2) (1997), 173\u2013213.","journal-title":"Combinatorica"},{"issue":"4","key":"2010_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.10081","volume":"22","author":"Y. Kohayakawa","year":"2003","unstructured":"Y. Kohayakawa and V. R\u00f6dl: Regular pairs in sparse random graphs I, Random Structures & Algorithms 22(4) (2003), 359\u2013434.","journal-title":"Random Structures & Algorithms"},{"key":"2010_CR14","unstructured":"B. Kreuter: Probabilistic versions of Ramsey\u2019s and Tur\u00e1n\u2019s theorems. PhD thesis, Humboldt-Universit\u00e4t zu Berlin, 1997."},{"issue":"1","key":"2010_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0963548303005856","volume":"13","author":"Y. Kohayakawa","year":"2004","unstructured":"Y. Kohayakawa, V. R\u00f6dl and M. Schacht: The Tur\u00e1n theorem for random graphs, Combin. Probab. Comput. 13(1) (2004), 61\u201391.","journal-title":"Combin. Probab. Comput."},{"key":"2010_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(82)90204-7","volume":"41","author":"D. J. Kleitman","year":"1982","unstructured":"D. J. Kleitman and K. J. Winston: On the number of graphs without 4-cycles, Discrete Mathematics 41 (1982), 167\u2013172.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"2010_CR17","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<260::AID-RSA3>3.0.CO;2-Q","volume":"16","author":"T. \u0141uczak","year":"2000","unstructured":"T. \u0141uczak: On triangle-free random graphs, Random Structures & Algorithms 16(3) (2000), 260\u2013276.","journal-title":"Random Structures & Algorithms"},{"issue":"3","key":"2010_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/rsa.10088","volume":"23","author":"T. Szab\u00f3","year":"2003","unstructured":"T. Szab\u00f3 and V. H. Vu: Tur\u00e1n\u2019s theorem in sparse random graphs, Random Structures & Algorithms 23(3) (2003), 225\u2013234.","journal-title":"Random Structures & Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2010-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2010-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2010-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T06:10:45Z","timestamp":1631340645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2010-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["2010"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2010-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}