{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:35:26Z","timestamp":1761896126356},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:00:00Z","timestamp":1437177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00493-015-3051-9","type":"journal-article","created":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T02:40:55Z","timestamp":1437187255000},"page":"493-512","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the densities of cliques and independent sets in graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Hao","family":"Huang","sequence":"first","affiliation":[]},{"given":"Nati","family":"Linial","sequence":"additional","affiliation":[]},{"given":"Humberto","family":"Naves","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Peled","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"3051_CR1","doi-asserted-by":"crossref","unstructured":"M.H. Albert, M.D. Atkinson, C.C. Handley, D.A. Holton and W. Stromquist: On packing densities of permutations, Electron. J. Combin. 9 (2002), #R5.","DOI":"10.37236\/1622"},{"key":"3051_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"V. Chv\u00e1tal and P. Hammer: Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977), 145\u2013162.","journal-title":"Ann. Discrete Math"},{"key":"3051_CR3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.jctb.2013.02.003","volume":"103","author":"S. Das","year":"2013","unstructured":"S. Das, H. Huang, J. Ma, H. Naves and B. Sudakov: A problem of Erd\u0151s on the minimum of k-cliques, J. Combinatorial Theory Ser. B 103 (2013), 344\u2013373.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3051_CR4","first-page":"459","volume":"7","author":"P. Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s: On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7 (1962), 459\u2013464.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"3051_CR5","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P. Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s and A. Stone: On the structure of linear graphs, Bull. Am. Math. Soc. 52 (1946), 1087\u20131091.","journal-title":"Bull. Am. Math. Soc"},{"key":"3051_CR6","first-page":"81","volume":"123","author":"P. Frankl","year":"1987","unstructured":"P. Frankl: The shifting techniques in extremal set theory, in: Surveys in Combinatorics, Lond. Math. Soc. Lect. Note Ser. 123 (1987), 81\u2013110.","journal-title":"Lond. Math. Soc. Lect. Note Ser"},{"key":"3051_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.jctb.2013.04.002","volume":"103","author":"P. Frankl","year":"2013","unstructured":"P. Frankl, M. Kato, G. Katona and N. Tokushige: Two-colorings with many monochromatic cliques in both colors, J. Comb. Theory Ser. B 103 (2013), 415\u2013427.","journal-title":"J. Comb. Theory Ser. B"},{"key":"3051_CR8","doi-asserted-by":"crossref","first-page":"778","DOI":"10.2307\/2310464","volume":"66","author":"A. Goodman","year":"1959","unstructured":"A. Goodman: On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778\u2013783.","journal-title":"Amer. Math. Monthly"},{"key":"3051_CR9","first-page":"187","volume-title":"Theory of Graphs Akad\u00e9mia Kiad\u00f3","author":"G. Katona","year":"1968","unstructured":"G. Katona: A theorem of finite sets, in: Theory of Graphs Akad\u00e9mia Kiad\u00f3, Budapest (1968), 187\u2013207."},{"key":"3051_CR10","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.aim.2008.03.023","volume":"218","author":"P. Keevash","year":"2008","unstructured":"P. Keevash: Shadows and intersections: stability and new proofs, Adv. Math. 218 (2008), 1685\u20131703.","journal-title":"Adv. Math"},{"key":"3051_CR11","first-page":"251","volume-title":"The number of simplicies in a complex","author":"J. Kruskal","year":"1963","unstructured":"J. Kruskal: The number of simplicies in a complex, Mathematical Optimization Techniques, Univ. of California Press (1963), 251\u2013278."},{"key":"3051_CR12","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1090\/S0002-9947-2010-05189-X","volume":"363","author":"V. Nikiforov","year":"2011","unstructured":"V. Nikiforov: The number of cliques in graphs of given order and size, Trans. Amer. Math. Soc. 363 (2011), 1599\u20131618.","journal-title":"Trans. Amer. Math. Soc"},{"key":"3051_CR13","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1017\/S0963548313000357","volume":"22","author":"O. Pikhurko","year":"2013","unstructured":"O. Pikhurko and E.R. Vaughan: Minimum number of k-cliques in graphs with bounded independence number, Combin. Probab. Computing 22 (2013), 910\u2013934.","journal-title":"Combin. Probab. Computing"},{"key":"3051_CR14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1017\/S0963548308009085","volume":"17","author":"A. Razborov","year":"2008","unstructured":"A. Razborov: On the minimal density of triangles in graphs, Combin. Probab. Computing 17 (2008), 603\u2013618.","journal-title":"Combin. Probab. Computing"},{"key":"3051_CR15","unstructured":"C. Reiher: Minimizing the number of cliques in graphs of given order and edge density, manuscript."},{"issue":"2","key":"3051_CR16","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"39","author":"A. Thomason","year":"1989","unstructured":"A. Thomason: A disproof of a conjecture of Erd\u0151s in Ramsey theory, J. London Math. Soc. (2) 39(2) (1989), 246\u2013255.","journal-title":"J. London Math. Soc. (2"},{"key":"3051_CR17","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: On an extremal problem in graph theory, Matematikai \u00e1s Fizikai Lapok 48 (1941), 436\u2013452.","journal-title":"Matematikai \u00e1s Fizikai Lapok"},{"key":"3051_CR18","first-page":"163","volume":"24","author":"A. Zykov","year":"1949","unstructured":"A. Zykov: On some properties of linear complexes, Mat. Sbornik N.S. 24 (1949), 163\u2013188.","journal-title":"Mat. Sbornik N.S."},{"key":"3051_CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(93)90366-2","volume":"114","author":"F. Franek","year":"1993","unstructured":"F. Franek and V. R\u00f6dl: 2-colorings of complete graphs with small number of monochromatic K 4 subgraphs, Discrete Mathematics 114 (1993), 199\u2013203.","journal-title":"Discrete Mathematics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3051-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3051-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3051-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3051-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T05:48:37Z","timestamp":1599284917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3051-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,18]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["3051"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3051-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,18]]}}}