{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:53Z","timestamp":1740107153405,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-019-02129-9","type":"journal-article","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T12:02:38Z","timestamp":1578571358000},"page":"459-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forbidding Multiple Copies of Forestable Graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2441-5713","authenticated-orcid":false,"given":"Neal","family":"Bushaw","sequence":"first","affiliation":[]},{"given":"Nathan","family":"Kettle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,9]]},"reference":[{"key":"2129_CR1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jctb.1999.1906","volume":"76","author":"N Alon","year":"1999","unstructured":"Alon, N., R\u00f3nyai, L., Szab\u00f3, T.: Norm-graphs: variations and applications. J. Combin. Theory Ser. B 76, 280\u2013290 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2129_CR2","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.4153\/CJM-1966-109-8","volume":"18","author":"C Benson","year":"1966","unstructured":"Benson, C.: Minimal regular graphs of girths eight and twelve. Can. J. Math. 18, 1091\u20131094 (1966)","journal-title":"Can. J. Math."},{"key":"2129_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1017\/S0963548311000460","volume":"20","author":"N Bushaw","year":"2011","unstructured":"Bushaw, N., Kettle, N.: Tur\u00e1n numbers of multiple paths and equibipartite forests. Combin. Probab. Comput. 20, 837\u2013853 (2011)","journal-title":"Combin. Probab. Comput."},{"key":"2129_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory, graduate texts in mathematics","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory, graduate texts in mathematics, vol. 184. Springer-Verlag, New York (1998)"},{"key":"2129_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"WG Brown","year":"1966","unstructured":"Brown, W.G.: On graphs that do not contain a Thomsen graph. Can. Math. Bull. 9, 281\u2013285 (1966)","journal-title":"Can. Math. Bull."},{"key":"2129_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"JA Bondy","year":"1974","unstructured":"Bondy, J.A., Simonovits, M.: Cycles of even length in graphs. J. Comb. Theory Ser. B 16, 97\u2013105 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2129_CR7","first-page":"215","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., R\u00e9nyi, A., S\u00f3s, V.T.: On a problem of graph theory. Studia Sci. Math. Hung. 1, 215\u2013235 (1966)","journal-title":"Studia Sci. Math. Hung."},{"key":"2129_CR8","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs. Bull. Am. Math. Soc. 52, 1087\u20131091 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"2129_CR9","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Math. Hung. 1, 51\u201357 (1966)","journal-title":"Studia Sci. Math. Hung."},{"key":"2129_CR10","volume-title":"Erd\u0151s Centennial, Bolyai Society Mathematical Studies","author":"Z F\u00fcredi","year":"2013","unstructured":"F\u00fcredi, Z., Simonovits, M.: The history of degenerate (bipartite) extremal graph problems. In: Lov\u00e1sz, L., Ruzsa, I.Z., S\u00f3s, V.T. (eds.) Erd\u0151s Centennial, Bolyai Society Mathematical Studies, vol. 25. Springer, Berlin, Heidelberg (2013)"},{"key":"2129_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jcta.1996.0067","volume":"75","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: New asymptotics for bipartite Tur\u00e1n numbers. J. Combin. Theory Ser. A 75, 141\u2013144 (1996)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2129_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.0052","volume":"68","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On the number of edges of quadrilateral-free graphs. J. Combin. Theory Ser. B 68, 1\u20136 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2129_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1017\/S0963548300001814","volume":"5","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: An upper bound on Zarankiewicz\u2019 problem. Combin. Probab. Comput. 5, 29\u201333 (1996)","journal-title":"Combin. Probab. Comput."},{"key":"2129_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","volume":"27","author":"I Gorgol","year":"2011","unstructured":"Gorgol, I.: Tur\u00e1n numbers for disjoint copies of graphs. Graphs Combin. 27, 661\u2013667 (2011)","journal-title":"Graphs Combin."},{"key":"2129_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01261323","volume":"16","author":"J Koll\u00e1r","year":"1996","unstructured":"Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T.: Norm-graphs and bipartite Tur\u00e1n numbers. Combinatorica 16, 399\u2013406 (1996)","journal-title":"Combinatorica"},{"key":"2129_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T K\u0151vari","year":"1954","unstructured":"K\u0151vari, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz, Colloquium Math. 3, 50\u201357 (1954)","journal-title":"Zarankiewicz, Colloquium Math."},{"key":"2129_CR17","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.laa.2009.10.040","volume":"432","author":"V Nikiforov","year":"2010","unstructured":"Nikiforov, V.: A contribution to the Zarankiewicz problem. Linear Algebra Appl. 432, 1405\u20131411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2129_CR18","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"2129_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","volume":"3","author":"P Tur\u00e1n","year":"1954","unstructured":"Tur\u00e1n, P.: On the theory of graphs. Colloquium Math. 3, 19\u201330 (1954)","journal-title":"Colloquium Math."},{"key":"2129_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0095-8956(91)90097-4","volume":"52","author":"R Wenger","year":"1991","unstructured":"Wenger, R.: Extremal graphs with no $$C\\_4$$\u2019s, $$C\\_6$$\u2019s, or $$C\\_{10}$$\u2019s. J. Combin. Theory Ser. B 52, 113\u2013116 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2129_CR21","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","volume":"340","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Zhang, X.: The Tur\u00e1n number of disjoint copies of paths. Discrete Math. 340(2), 132\u2013139 (2017)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02129-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02129-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02129-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T01:06:12Z","timestamp":1610067972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02129-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2129"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02129-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,1,9]]},"assertion":[{"value":"31 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}