{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T22:44:31Z","timestamp":1781736271558,"version":"3.54.5"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00373-010-0999-5","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T08:14:11Z","timestamp":1294128851000},"page":"661-667","source":"Crossref","is-referenced-by-count":38,"title":["Tur\u00e1n Numbers for Disjoint Copies of Graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Izolda","family":"Gorgol","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"999_CR1","volume-title":"Extremal graph theory","author":"B. Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B.: Extremal graph theory. Dover Publications, Mineola (2004)"},{"key":"999_CR2","volume-title":"Modern graph theory","author":"B. Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s B.: Modern graph theory. Springer-Verlag, New York (2002)"},{"key":"999_CR3","volume-title":"Graph theory","author":"R. Diestel","year":"1997","unstructured":"Diestel R.: Graph theory. Springer-Verlag, New York (1997)"},{"key":"999_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P., Gallai T.: On maximal paths and circuits in graphs . Acta Math. Acad. Sci. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"999_CR5","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/j.aim.2005.04.011","volume":"203","author":"Z. F\u00fcredi","year":"2006","unstructured":"F\u00fcredi Z., Naor A., Verstra\u00ebte J.: On the Tur\u00e1n number for the hexagon.. Adv. Math. 203, 476\u2013496 (2006)","journal-title":"Adv. Math."},{"key":"999_CR6","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of Erd\u0151s. In: Erd\u0151s, P., Renyi, A., S\u00f3s, V.: (eds) Combinatorial Theory an its Applications, vol. II. Colloq. Math. Soc. J. Bolyai 4, North-Holland, pp. 1163\u20131164 (1970)"},{"key":"999_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02412090","volume":"55","author":"O. Ore","year":"1961","unstructured":"Ore O.: Arc coverings of graphs. Ann. Math. Pure Appl. 55, 315\u2013321 (1961)","journal-title":"Ann. Math. Pure Appl."},{"key":"999_CR8","first-page":"279","volume-title":"Theory of Graphs","author":"M. Simonovits","year":"1968","unstructured":"Simonovits M.: A method for solving extremal problems in extremal graph theory. In: Erd\u0151s, P., Katona, G. (eds) Theory of Graphs, pp. 279\u2013319. Academic Press, New York (1968)"},{"key":"999_CR9","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/jgt.20141","volume":"51","author":"J. Shen","year":"2006","unstructured":"Shen J.: On two Tur\u00e1n numbers. J. Graph Theory 51, 244\u2013250 (2006)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0999-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0999-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0999-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:31Z","timestamp":1559055511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0999-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["999"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0999-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}