{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:49:38Z","timestamp":1649076578057},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,10]],"date-time":"2013-03-10T00:00:00Z","timestamp":1362873600000},"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":[[2014,5]]},"DOI":"10.1007\/s00373-013-1300-5","type":"journal-article","created":{"date-parts":[[2013,3,9]],"date-time":"2013-03-09T08:00:27Z","timestamp":1362816027000},"page":"627-632","source":"Crossref","is-referenced-by-count":2,"title":["Packing Triangles in K 4-Free Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Shunchang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Lingsheng","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,10]]},"reference":[{"key":"1300_CR1","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Berlin (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"3","key":"1300_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2(3), 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"1300_CR3","unstructured":"Du, X.; Shi L.: Graphs with small independence number minimizing the spectral radius. Discret Math Algorithms Appl (to appear)"},{"key":"1300_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1215\/ijm\/1255631811","volume":"6","author":"P. Erd\u0151s","year":"1962","unstructured":"Erd\u0151s P.: On a theorem of Rademacher-Tur\u00e1n. Illinois J. Math. 6, 122\u2013127 (1962)","journal-title":"Illinois J. Math."},{"key":"1300_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.21136\/CPM.1969.108598","volume":"94","author":"P. Erd\u0151s","year":"1969","unstructured":"Erd\u0151s P.: On the number of complete subgraphs contained in certain graphs. Casopis Pest. Mat. 94, 290\u2013296 (1969)","journal-title":"Casopis Pest. Mat."},{"key":"1300_CR6","unstructured":"Erd\u0151s, P.: Some unsolved problems in graph theory and combinatorial analysis. Combinatorial Mathematics and Its Applications, Proceedings Conference, 1969, Acadamic Press, Oxford, pp. 97\u2013109 (1971)"},{"key":"1300_CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1002\/jgt.3190130411","volume":"13","author":"D. Fisher","year":"1989","unstructured":"Fisher D.: Lower bounds on the number of triangles in a graph. J. Graph Theory 13, 505\u2013512 (1989)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1300_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01205075","volume":"11","author":"E. Gy\u00f6ri","year":"1991","unstructured":"Gy\u00f6ri E.: On the number of edge disjoint cliques in graphs of given size. Combinatorica 11(3), 231\u2013243 (1991)","journal-title":"Combinatorica"},{"key":"1300_CR9","unstructured":"Gy\u00f6ri, E.: On the number of edge disjoint triangles in graphs of given size, Combinatorics. In: Proceedings of the 7-th Hungarian Combinatorial Colloquium, Eger, pp. 267\u2013276 (1987)"},{"key":"1300_CR10","unstructured":"Mantel, W.: Problem 28: Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff. Wiskundige Opgaven 10, 60\u201361 (1907)"},{"key":"1300_CR11","unstructured":"Nguyen, H.H.: On the problems of edge disjoint cliques in graphs. Master Thesis, E\u0151tv\u0151s Lornd University, Mathematics Department (2005)"},{"key":"1300_CR12","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"A.A. Razborov","year":"2007","unstructured":"Razborov A.A.: Flag algebras. J. Symbolic Logic 72, 1239\u20131282 (2007)","journal-title":"J. Symbolic Logic"},{"key":"1300_CR13","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1017\/S0963548308009085","volume":"17","author":"A.A. Razborov","year":"2008","unstructured":"Razborov A.A.: On the minimal density of triangles in graphs. Comb. Probab. Comput. 17, 603\u2013618 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"1300_CR14","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1300-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1300-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1300-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T18:17:12Z","timestamp":1644517032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1300-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1300"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1300-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,10]]}}}