{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T05:03:02Z","timestamp":1779685382330,"version":"3.53.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271484"],"award-info":[{"award-number":["12271484"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201559"],"award-info":[{"award-number":["12201559"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Supported by National Natural Science Foundation of Chin","award":["12271848"],"award-info":[{"award-number":["12271848"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s40314-026-03804-3","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T04:20:50Z","timestamp":1779682850000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient enumeration of cliques in graphs with bounded maximum degree"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-8308","authenticated-orcid":false,"given":"Shi-Cai","family":"Gong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia-Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin-Hao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo-Jun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,25]]},"reference":[{"issue":"3","key":"3804_CR1","first-page":"64","volume":"10","author":"BM \u00c1brego","year":"2009","unstructured":"\u00c1brego BM, Fern\u00e1ndez-Merchant S, Neubauer MG, Watkins W (2009) Sum of squares of degrees in a graph. J Inequal Pure and Appl Math 10(3):64","journal-title":"J Inequal Pure and Appl Math"},{"issue":"37","key":"3804_CR2","first-page":"11","volume":"19","author":"J Alexander","year":"2012","unstructured":"Alexander J, Cutler J, Mink T (2012) Independent sets in graphs with given minimum degree. Electron J Combin 19(37):11","journal-title":"Electron J Combin"},{"key":"3804_CR3","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (2008) Graph Theory, GTM, vol 244. Springer,","DOI":"10.1007\/978-1-84628-970-5"},{"key":"3804_CR4","doi-asserted-by":"crossref","unstructured":"Chase Z (2020) The maximum number of triangles in a graph of given maximum degree, Adv. in Combin. 10, #R5","DOI":"10.19086\/aic.16788"},{"key":"3804_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.jctb.2022.10.004","volume":"158","author":"EK Cho","year":"2023","unstructured":"Cho EK, Kim J, Kim SI (2023) Independent domination of graphs with bounded maximum degree. J Combin Theory Ser B 158:341\u2013352","journal-title":"J Combin Theory Ser B"},{"key":"3804_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s00373-021-02454-y","volume":"38","author":"J Cutler","year":"2022","unstructured":"Cutler J, Nir J, Radcliffe AJ (2022) Supersaturation for subgraph counts. Graphs Combin 38:6","journal-title":"Graphs Combin"},{"key":"3804_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jctb.2013.10.003","volume":"104","author":"J Cutler","year":"2014","unstructured":"Cutler J, Radcliffe AJ (2014) The maximum number of complete subgraphs in a graph with given maximum degree. J Combin Theory Ser B 104:60\u201371","journal-title":"J Combin Theory Ser B"},{"key":"3804_CR8","first-page":"459","volume":"7","author":"P Erd\u00f6s","year":"1962","unstructured":"Erd\u00f6s P (1962) On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad Mat Kutat\u00f3 Int K\u00f6zl 7:459\u2013464","journal-title":"Akad Mat Kutat\u00f3 Int K\u00f6zl"},{"key":"3804_CR9","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1016\/j.disc.2011.06.015","volume":"311","author":"D Galvin","year":"2011","unstructured":"Galvin D (2011) Two problems on independent sets in graphs. Discrete Math 311:2105\u20132112","journal-title":"Discrete Math"},{"key":"3804_CR10","first-page":"1567","volume":"29","author":"NG Had\u017eiivanov","year":"1976","unstructured":"Had\u017eiivanov NG (1976) A generalization of Tur\u00e1n\u2019s theorem on graphs. C R Acad Bulgare Sci 29:1567\u20131570","journal-title":"C R Acad Bulgare Sci"},{"issue":"5","key":"3804_CR11","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.jctb.2006.01.006","volume":"96","author":"S Norine","year":"2006","unstructured":"Norine S, Seymour P, Thomas R, Wollan P (2006) Proper minor-closed families are small. J Combin Theory Ser B 96(5):754\u2013757","journal-title":"J Combin Theory Ser B"},{"key":"3804_CR12","doi-asserted-by":"crossref","unstructured":"Reed B, Wood DR (2005) Fast separation in a graph with an excluded minor. In: Proc. European Conf. on Combinatorics, Graph Theory and Applications (EuroComb\u201905), vol. AE of Discrete Math. Theor. Comput. Sci. Proceedings, 45\u201350","DOI":"10.46298\/dmtcs.3419"},{"key":"3804_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(76)90069-8","volume":"14","author":"S Roman","year":"1976","unstructured":"Roman S (1976) The maximum number of $$ q $$-cliques in a graph with no $$ p $$-clique. Discrete Math 14:365\u2013371","journal-title":"Discrete Math"},{"key":"3804_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0095-8956(71)90071-2","volume":"10","author":"N Sauer","year":"1971","unstructured":"Sauer N (1971) A generalization of a theorem of Tur\u00e1n. J Combin Theory Ser B 10:109\u2013112","journal-title":"J Combin Theory Ser B"},{"key":"3804_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J Kahn","year":"2001","unstructured":"Kahn J (2001) An entropy approach to the hard-core model on bipartite graphs. Combin Probab Comput 10:219\u2013237","journal-title":"Combin Probab Comput"},{"key":"3804_CR16","unstructured":"Katona G (1968) A theorem of finite sets, in: Theory of Graphs, Proc. Colloq., Tihany, 1966, Academic Press, New York, 187\u2013207"},{"issue":"6","key":"3804_CR17","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00493-014-3188-y","volume":"36","author":"L Keough","year":"2016","unstructured":"Keough L, Radcliffe AJ (2016) Graphs with the fewest matchings. Combinatorica 36(6):703\u2013723","journal-title":"Combinatorica"},{"key":"3804_CR18","doi-asserted-by":"crossref","unstructured":"Kirsch R, Radcliffe AJ (2019) Many triangles with few edges, Electron. J. Combin. 26 (2) #R36","DOI":"10.37236\/7343"},{"key":"3804_CR19","doi-asserted-by":"crossref","unstructured":"Kirsch R, Radcliffe AJ (2021) Many cliques with few edges, Electron. J. Combin. 28 (1) #R26","DOI":"10.37236\/9550"},{"key":"3804_CR20","doi-asserted-by":"crossref","unstructured":"Kruskal JB (1963) The number of simplices in a complex, in: Mathematical Optimization Techniques, Univ. of California Press, Berkeley, Calif, 251\u2013278","DOI":"10.1525\/9780520319875-014"},{"key":"3804_CR21","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) On an extremal problem in graph theory. Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"},{"key":"3804_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y Zhao","year":"2010","unstructured":"Zhao Y (2010) The number of independent sets in a regular graph. Combin Probab Comput 19:315\u2013320","journal-title":"Combin Probab Comput"},{"key":"3804_CR23","unstructured":"Zykov AA (1949) On some properties of linear complexes. Mat Sb (NS) 24(66):163\u2013188"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03804-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03804-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03804-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T04:20:53Z","timestamp":1779682853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03804-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["3804"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03804-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,25]]},"assertion":[{"value":"29 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"404"}}