{"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":1740107129414,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["524418"],"award-info":[{"award-number":["524418"]}],"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":[[2024,12]]},"DOI":"10.1007\/s00373-024-02854-w","type":"journal-article","created":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T13:46:46Z","timestamp":1731246406000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-8898-5702","authenticated-orcid":false,"given":"John","family":"Engbers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,10]]},"reference":[{"key":"2854_CR1","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1006\/jctb.1999.1899","volume":"77","author":"G Brightwell","year":"1999","unstructured":"Brightwell, G., Winkler, P.: Graph homomorphisms and phase transitions. J. Comb. Theory Ser. B 77, 415\u2013435 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2854_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejc.2016.11.003","volume":"62","author":"E Cohen","year":"2017","unstructured":"Cohen, E., Csikv\u00e1ri, P., Perkins, W., Tetali, P.: The Widom\u2013Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62, 70\u201376 (2017)","journal-title":"Eur. J. Comb."},{"key":"2854_CR3","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, A.J.: The maximum number of complete subgraphs in a graph with given maximum degree. J. Combin. Theory Ser. B 104, 60\u201371 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2854_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/jgt.21820","volume":"79","author":"J Engbers","year":"2015","unstructured":"Engbers, J.: Extremal $$H$$-colorings of graphs with fixed minimum degree. J. Graph Theory 79, 103\u2013124 (2015)","journal-title":"J. Graph Theory"},{"key":"2854_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/jgt.21658","volume":"73","author":"D Galvin","year":"2013","unstructured":"Galvin, D.: Maximizing H-colorings of a regular graph. J. Graph Theory 73, 66\u201384 (2013)","journal-title":"J. Graph Theory"},{"key":"2854_CR6","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1090\/dimacs\/063\/07","volume-title":"Graphs, Morphisms and Statistical Physics","author":"D Galvin","year":"2004","unstructured":"Galvin, D., Tetali, P.: On weighted graph homomorphisms. In: Graphs, Morphisms and Statistical Physics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 63, pp. 97\u2013104. American Mathematical Society, Providence (2004)"},{"key":"2854_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/jgt.22446","volume":"92","author":"H Guggiari","year":"2019","unstructured":"Guggiari, H., Scott, A.: Maximizing $$H$$-colourings of graphs. J. Graph Theory 92, 172\u2013185 (2019)","journal-title":"J. Graph Theory"},{"key":"2854_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J Kahn","year":"2001","unstructured":"Kahn, J.: An entropy approach to the hard-core model on bipartite graphs. Combin. Prob. Comput. 10, 219\u2013237 (2001)","journal-title":"Combin. Prob. Comput."},{"key":"2854_CR9","volume-title":"Large Networks and Graph Limits","author":"L Lov\u00e1sz","year":"2012","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits, vol. 60. American Mathematical Society Colloquium Publications, Providence, Rhode Island (2012)"},{"key":"2854_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jctb.2019.01.007","volume":"138","author":"A Sah","year":"2019","unstructured":"Sah, A., Sawhney, M., Stoner, D., Zhao, Y.: The number of independent sets in an irregular graph. J. Combin. Theory Ser. B 138, 172\u2013195 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2854_CR11","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00222-020-00956-9","volume":"221","author":"A Sah","year":"2020","unstructured":"Sah, A., Sawhney, M., Stoner, D., Zhao, Y.: A reverse Sidorenko inequality. Invent. Math. 221, 665\u2013711 (2020)","journal-title":"Invent. Math."},{"key":"2854_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jgt.22148","volume":"87","author":"L Sernau","year":"2017","unstructured":"Sernau, L.: Graph operations and upper bounds on graph homomorphism counts. J. Graph Theory 87, 149\u2013163 (2017)","journal-title":"J. Graph Theory"},{"key":"2854_CR13","series-title":"Graduate Studies in Mathematics","volume-title":"An Epsilon of Room, I: Real Analysis: Pages from Year Three of a Mathematical Blog","author":"T Tao","year":"2009","unstructured":"Tao, T.: An Epsilon of Room, I: Real Analysis: Pages from Year Three of a Mathematical Blog. Graduate Studies in Mathematics, vol. 117. AMS, Providence, RI (2009)"},{"key":"2854_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y Zhao","year":"2010","unstructured":"Zhao, Y.: The number of independent sets in a regular graph. Combin. Prob. Comput. 19, 315\u2013320 (2010)","journal-title":"Combin. Prob. Comput."},{"key":"2854_CR15","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/100800415","volume":"25","author":"Y Zhao","year":"2011","unstructured":"Zhao, Y.: The bipartite swapping trick on graph homomorphisms. SIAM J. Discrete Math. 25, 660\u2013680 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"2854_CR16","doi-asserted-by":"publisher","first-page":"827","DOI":"10.4169\/amer.math.monthly.124.9.827","volume":"124","author":"Y Zhao","year":"2017","unstructured":"Zhao, Y.: Extremal regular graphs: independent sets and graph homomorphisms. Am. Math. Mon. 124, 827\u2013843 (2017)","journal-title":"Am. Math. Mon."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02854-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s00373-024-02854-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02854-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:24Z","timestamp":1733515644000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s00373-024-02854-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,10]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2854"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00373-024-02854-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,10]]},"assertion":[{"value":"8 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 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 author declares that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"121"}}