{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:51:12Z","timestamp":1767995472176,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["524435"],"award-info":[{"award-number":["524435"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["429383"],"award-info":[{"award-number":["429383"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-021-02454-y","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Supersaturation for Subgraph Counts"],"prefix":"10.1007","volume":"38","author":[{"given":"Jonathan","family":"Cutler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6198-6454","authenticated-orcid":false,"given":"JD","family":"Nir","sequence":"additional","affiliation":[]},{"given":"A. J.","family":"Radcliffe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2454_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","volume":"121","author":"N Alon","year":"2016","unstructured":"Alon, N., Shikhelman, C.: Many $$T$$ copies in $$H$$-free graphs. J. Combin. Theory Ser. B 121, 146\u2013172 (2016)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2454_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1017\/S0305004100052063","volume":"79","author":"B Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B.: On complete subgraphs of different orders. Math. Proc. Camb. Philos. Soc. 79(1), 19\u201324 (1976)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2454_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Nikiforov, V.: Degree powers in graphs with forbidden subgraphs. Electron. J. Combin. 11(1), 8 (2004). Research Paper 42. http:\/\/www.combinatorics.org\/Volume_11\/Abstracts\/v11i1r42.html","DOI":"10.37236\/1795"},{"key":"2454_CR4","doi-asserted-by":"crossref","unstructured":"Caro, Y., Yuster, R.: A Tur\u00e1n type problem concerning the powers of the degrees of a graph. Electron. J. Combin. 7, 14 (2000). Research Paper 47. http:\/\/www.combinatorics.org\/Volume_7\/Abstracts\/v7i1r47.html","DOI":"10.37236\/1525"},{"key":"2454_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.19086\/aic.16788","volume":"10","author":"Z Chase","year":"2020","unstructured":"Chase, Z.: The maximum number of triangles in a graph of given maximum degree. Adv. Comb. 10, 5 (2020). https:\/\/doi.org\/10.19086\/aic.16788","journal-title":"Adv. Comb."},{"issue":"2","key":"2454_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jgt.21756","volume":"76","author":"J Engbers","year":"2014","unstructured":"Engbers, J., Galvin, D.: Counting independent sets of a fixed size in graphs with a given minimum degree. J. Graph Theory 76(2), 149\u2013168 (2014). https:\/\/doi.org\/10.1002\/jgt.21756","journal-title":"J. Graph Theory"},{"key":"2454_CR7","first-page":"13","volume":"9","author":"P Erd\u0151s","year":"1955","unstructured":"Erd\u0151s, P.: Some theorems on graphs. Riveon Lematematika 9, 13\u201317 (1955)","journal-title":"Riveon Lematematika"},{"key":"2454_CR8","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P.: On a theorem of Rademacher\u2013Tur\u00e1n. Ill. J. Math. 6, 122\u2013127 (1962). http:\/\/projecteuclid.org\/euclid.ijm\/1255631811","DOI":"10.1215\/ijm\/1255631811"},{"key":"2454_CR9","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P.: On the number of complete subgraphs contained in certain graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7, 459\u2013464 (1962)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"2454_CR10","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pp. 29\u201336. Publ. House Czechoslovak Acad. Sci., Prague (1964)"},{"key":"2454_CR11","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."},{"issue":"1","key":"2454_CR12","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(1), 141\u2013144 (1996)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"2454_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0963548314000546","volume":"24","author":"W Gan","year":"2015","unstructured":"Gan, W., Loh, P.S., Sudakov, B.: Maximizing the number of independent sets of a fixed size. Combin. Probab. Comput. 24(3), 521\u2013527 (2015). https:\/\/doi.org\/10.1017\/S0963548314000546","journal-title":"Combin. Probab. Comput."},{"key":"2454_CR14","doi-asserted-by":"crossref","unstructured":"Gerbner, D., Patk\u00f3s, B.: Generalized Tur\u00e1n problems for complete bipartite graphs (2021) (under review)","DOI":"10.7151\/dmgt.2388"},{"issue":"3","key":"2454_CR15","first-page":"773","volume":"88","author":"E Gy\u0151ri","year":"2019","unstructured":"Gy\u0151ri, E., Salia, N., Tompkins, C., Zamora, O.: The maximum number of $$P_\\ell$$ copies in $$P_k$$-free graphs. Acta Math. Univ. Comenian. (N.S.) 88(3), 773\u2013778 (2019)","journal-title":"Acta Math. Univ. Comenian. (N.S.)"},{"issue":"1","key":"2454_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01789461","volume":"7","author":"E Gy\u00f6ri","year":"1991","unstructured":"Gy\u00f6ri, E., Pach, J., Simonovits, M.: On the maximal number of certain subgraphs in $$k_r$$-free graphs. Graphs Comb. 7(1), 31\u201337 (1991). https:\/\/doi.org\/10.1007\/BF01789461","journal-title":"Graphs Comb."},{"issue":"2","key":"2454_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1002\/jgt.22652","volume":"97","author":"A Halfpap","year":"2021","unstructured":"Halfpap, A., Palmer, C.: On supersaturation and stability for generalized Tur\u00e1n problems. J Graph Theor. 97(2), 232\u2013240 (2021). \nhttps:\/\/doi.org\/10.1002\/jgt.22652","journal-title":"J Graph Theor."},{"key":"2454_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103367","author":"B Lidick\u00fd","year":"2021","unstructured":"Lidick\u00fd, B., Murphy, K.: Maximizing five-cycles in $$k_r$$-free graphs. Eur J Combin. (2021). https:\/\/doi.org\/10.1016\/j.ejc.2021.103367","journal-title":"Eur J Combin."},{"key":"2454_CR19","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/361","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises, 2nd edn. AMS Chelsea Publishing, Providence (2007). https:\/\/doi.org\/10.1090\/chel\/361","edition":"2"},{"key":"2454_CR20","unstructured":"Lov\u00e1sz, L., Simonovits, M.: On the number of complete subgraphs of a graph, pp. 431\u2013441. Congressus Numerantium, No. XV (1976)"},{"key":"2454_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-0348-5438-2_41","volume-title":"Studies in Pure Mathematics","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L., Simonovits, M.: On the number of complete subgraphs of a graph. II. In: Studies in Pure Mathematics, pp. 459\u2013495. Basel, Birkh\u00e4user (1983)"},{"key":"2454_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","volume":"128","author":"R Luo","year":"2018","unstructured":"Luo, R.: The maximum number of cliques in graphs without long cycles. J. Combin. Theory Ser. B 128, 219\u2013226 (2018). https:\/\/doi.org\/10.1016\/j.jctb.2017.08.005","journal-title":"J. Combin. Theory Ser. B"},{"key":"2454_CR23","first-page":"283","volume":"7","author":"JW Moon","year":"1962","unstructured":"Moon, J.W., Moser, L.: On a problem of Tur\u00e1n. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7, 283\u2013286 (1962)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"issue":"1","key":"2454_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1112\/blms\/bdm093","volume":"40","author":"V Nikiforov","year":"2008","unstructured":"Nikiforov, V.: Graphs with many $$r$$-cliques have large complete $$r$$-partite subgraphs. Bull. Lond. Math. Soc. 40(1), 23\u201325 (2008)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"2454_CR25","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1090\/S0002-9947-2010-05189-X","volume":"363","author":"V Nikiforov","year":"2011","unstructured":"Nikiforov, V.: The number of cliques in graphs of given order and size. Trans. Am. Math. Soc. 363(3), 1599\u20131618 (2011). https:\/\/doi.org\/10.1090\/S0002-9947-2010-05189-X","journal-title":"Trans. Am. Math. Soc."},{"key":"2454_CR26","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jctb.2016.12.001","volume":"123","author":"O Pikhurko","year":"2017","unstructured":"Pikhurko, O., Yilma, Z.B.: Supersaturation problem for color-critical graphs. J. Combin. Theory Ser. B 123, 148\u2013185 (2017). https:\/\/doi.org\/10.1016\/j.jctb.2016.12.001","journal-title":"J. Combin. Theory Ser. B"},{"key":"2454_CR27","unstructured":"Rademacher, H.: unpublished (1941)"},{"issue":"4","key":"2454_CR28","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1017\/S0963548308009085","volume":"17","author":"AA Razborov","year":"2008","unstructured":"Razborov, A.A.: On the minimal density of triangles in graphs. Combin. Probab. Comput. 17(4), 603\u2013618 (2008). https:\/\/doi.org\/10.1017\/S0963548308009085","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"2454_CR29","doi-asserted-by":"publisher","first-page":"683","DOI":"10.4007\/annals.2016.184.3.1","volume":"184","author":"C Reiher","year":"2016","unstructured":"Reiher, C.: The clique density theorem. Ann. Math. (2) 184(3), 683\u2013707 (2016). https:\/\/doi.org\/10.4007\/annals.2016.184.3.1","journal-title":"Ann. Math. (2)"},{"key":"2454_CR30","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"},{"issue":"3","key":"2454_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00373-007-0738-8","volume":"23","author":"DR Wood","year":"2007","unstructured":"Wood, D.R.: On the maximum number of cliques in a graph. Graphs Combin. 23(3), 337\u2013352 (2007). https:\/\/doi.org\/10.1007\/s00373-007-0738-8","journal-title":"Graphs Combin."},{"issue":"66","key":"2454_CR32","first-page":"163","volume":"24","author":"AA Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat Sbornik N S 24(66), 163\u2013188 (1949)","journal-title":"Mat Sbornik N S"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02454-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02454-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02454-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:42:28Z","timestamp":1654814548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02454-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2454"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02454-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"18 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"65"}}