{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:29Z","timestamp":1740107129177,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"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":["12361070"],"award-info":[{"award-number":["12361070"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,12]]},"DOI":"10.1007\/s00373-024-02860-y","type":"journal-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T20:49:14Z","timestamp":1731012554000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The sparse sequences of graphs"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0167-220X","authenticated-orcid":false,"given":"Sumin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"2860_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(80)90062-3","volume":"28","author":"R Ahlswede","year":"1980","unstructured":"Ahlswede, R.: Simple hypergraphs with maximal number of adjacent pairs of edges. J. Comb. Theory (B) 28, 164\u2013167 (1980)","journal-title":"J. Comb. Theory (B)"},{"key":"2860_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithm 34, 203\u2013221 (2000)","journal-title":"J. Algorithm"},{"key":"2860_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskara,A., Charikar,M., Chlamtac,E., Feige,U., Vijayaraghavan,A.: Detecting high log-densities an $$o(n^{\\frac{1}{4}})$$ approximation for densest $$k$$-subgraph (2010). CoRR, arXiv:1001.2891","DOI":"10.1145\/1806689.1806719"},{"issue":"3","key":"2860_CR4","first-page":"171","volume":"43","author":"A Billionnet","year":"2005","unstructured":"Billionnet, A.: Different formulations for solving the heaviest $$k$$-subgraph problem. Inf. Syst. Oper. Res. 43(3), 171\u2013186 (2005)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"18","key":"2860_CR5","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1016\/j.dam.2011.10.011","volume":"160","author":"F Bonomo","year":"2012","unstructured":"Bonomo, F., Maranco, J., Saban, D., Stier-Moses, N.: A polyhedral study of the maximum edge subgraph problem. Discrete Appl. Math. 160(18), 2573\u20132590 (2012)","journal-title":"Discrete Appl. Math."},{"key":"2860_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9, 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"2860_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00493-014-3133-0","volume":"36","author":"S Das","year":"2016","unstructured":"Das, S., Gan, W., Sudakov, B.: The minimum number of disjoint pairs in set systems and related problems. Combinatorica 36(6), 623\u2013660 (2016)","journal-title":"Combinatorica"},{"key":"2860_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxf. (2) 12, 313\u2013320 (1961)","journal-title":"Q. J. Math. Oxf. (2)"},{"key":"2860_CR9","unstructured":"Feige,U., Seltser,M.: On the densest $$k$$-subgraph problem. Technical report CS97-16, Weizmann Institute (1997)"},{"key":"2860_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense $$k$$-subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"2860_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2022.06.018","volume":"321","author":"G Katona","year":"2001","unstructured":"Katona, G.: A generalization of the independence number. Discrete Appl. Math. 321, 1\u20133 (2001)","journal-title":"Discrete Appl. Math."},{"key":"2860_CR12","first-page":"155","volume":"9","author":"JM Keil","year":"1991","unstructured":"Keil, J.M., Brecht, T.B.: The complexity of clustering in planar graphs. J. Comb. Math. Comb. Comput. 9, 155\u2013159 (1991)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2860_CR13","unstructured":"Kleitman,D.: A conjecture of Erd\u0151s-Katona on commensurable pairs among subsets of an $$n$$-set. In: Theory of Graphs: Proc. Colloq. Tihany, pp. 215\u2013218 (1966)"},{"key":"2860_CR14","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 692\u2013701. IEEE, Piscataway (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"key":"2860_CR15","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1016\/j.dam.2007.09.025","volume":"157","author":"J Qian","year":"2009","unstructured":"Qian, J., Engel, K., Xu, W.: A generalization of Sperner\u2019s theorem and an application to graph orientations. Discrete Appl. Math. 157, 2170\u20132176 (2009)","journal-title":"Discrete Appl. Math."},{"key":"2860_CR16","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz ber Untermengen einer endlichen Menge. Math. Z. 27, 544\u2013548 (1928)","journal-title":"Math. Z."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02860-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02860-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02860-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:23Z","timestamp":1733515643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02860-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,7]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2860"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02860-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,7]]},"assertion":[{"value":"27 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. All authors contributed to the study conception and design.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"119"}}