{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T21:45:31Z","timestamp":1773006331182,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"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":[[2013,10]]},"DOI":"10.1007\/s00493-013-2845-x","type":"journal-article","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T08:11:35Z","timestamp":1385367095000},"page":"623-631","source":"Crossref","is-referenced-by-count":14,"title":["K 4-free graphs without large induced triangle-free subgraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Guy","family":"Wolfovitz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"key":"2845_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF03352998","volume":"13","author":"N Alon","year":"1997","unstructured":"N. Alon and M. Krivelevich: Constructive bounds for a Ramsey-type problem, Graphs Combin. 13 (1997), 217\u2013225.","journal-title":"Graphs Combin."},{"key":"2845_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(91)90042-Z","volume":"87","author":"B Bollob\u00e1s","year":"1991","unstructured":"B. Bollob\u00e1s and H. R. Hind: Graphs without large triangle free subgraphs, Discrete Math. 87 (1991), 119\u2013131.","journal-title":"Discrete Math."},{"key":"2845_CR3","unstructured":"A. Dudek and V. R\u00f6dl: On K s-free subgraphs in K s+k -free Graphs and Vertex Folkman Numbers, to appear."},{"key":"2845_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-0-8176-8092-3_4","volume-title":"Ramsey theory, Progr. Math. vol. 285","author":"A Dudek","year":"2011","unstructured":"A. Dudek and V. R\u0151dl: On the function of Erd\u0151s and Rogers, Ramsey theory, Progr. Math. vol. 285, Birkh\u00e4user\/Springer, New York, 2011, 63\u201376."},{"key":"2845_CR5","first-page":"181","volume":"6","author":"P Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s and T. Gallai: On the minimal number of vertices representing the edges of a graph., Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl. 6 (1961), 181\u2013203 (English, with Russian summary).","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl."},{"key":"2845_CR6","doi-asserted-by":"crossref","first-page":"702","DOI":"10.4153\/CJM-1962-060-4","volume":"14","author":"P Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s and C. A. Rogers: The construction of certain graphs, Canad. J. Math. 14 (1962), 702\u2013707.","journal-title":"Canad. J. Math."},{"key":"2845_CR7","volume-title":"Graduate Texts in Mathematics, vol. 207","author":"C Godsil","year":"2001","unstructured":"C. Godsil and G. Royle: Algebraic graph theory, Graduate Texts in Mathematics, vol. 207, Springer-Verlag, New York, 2001."},{"key":"2845_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718.scard","volume-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"S Janson","year":"2000","unstructured":"S. Janson, T. Luczak and A. Ruci\u0144ski: Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000."},{"key":"2845_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/rsa.3240070204","volume":"7","author":"M Krivelevich","year":"1995","unstructured":"M. Krivelevich: Bounding Ramsey numbers through large deviation inequalities, Random Structures Algorithms 7 (1995), 145\u2013155.","journal-title":"Random Structures Algorithms"},{"key":"2845_CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1017\/S0963548300001243","volume":"3","author":"M Krivelevich","year":"1994","unstructured":"M. Krivelevich: K s-free graphs without large K r-free subgraphs, Combin. Probab. Comput. 3 (1994), 349\u2013354.","journal-title":"Combin. Probab. Comput."},{"key":"2845_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1006\/jctb.1994.1026","volume":"61","author":"N Linial","year":"1994","unstructured":"N. Linial and Y. Rabinovich: Local and global clique numbers, J. Combin. Theory Ser. B 61 (1994), 5\u201315.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2845_CR12","series-title":"London Math. Soc. Lecture Note Ser.","first-page":"148","volume-title":"Surveys in combinatorics","author":"C McDiarmid","year":"1989","unstructured":"C. McDiarmid: On the method of bounded differences, Surveys in combinatorics, 1989 (Norwich, 1989), London Math. Soc. Lecture Note Ser., vol. 141, Cambridge Univ.Press, Cambridge, 1989, 148\u2013188."},{"key":"2845_CR13","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s00493-005-0029-3","volume":"25","author":"B Sudakov","year":"2005","unstructured":"B. Sudakov: A new lower bound for a Ramsey-type problem, Combinatorica 25 (2005), 487\u2013498.","journal-title":"Combinatorica"},{"key":"2845_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/rsa.20035","volume":"26","author":"B Sudakov","year":"2005","unstructured":"B. Sudakov: Large K r-free subgraphs in K s-free graphs and some other Ramseytype problems, Random Structures Algorithms 26 (2005), 253\u2013265.","journal-title":"Random Structures Algorithms"},{"key":"2845_CR15","volume-title":"When does the K 4-free process stop?","author":"L Warnke","year":"2010","unstructured":"L. Warnke: When does the K 4-free process stop? (2010), available at arXiv:1007.3037v2[math.CO]."},{"key":"2845_CR16","volume-title":"The K 4-free process","author":"G Wolfovitz","year":"2010","unstructured":"G. Wolfovitz: The K 4-free process (2010), available at arXiv:1008.4044v1[math.CO]."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2845-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2845-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2845-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:49Z","timestamp":1559093569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2845-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["2845"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2845-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}