{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:05:52Z","timestamp":1776841552063,"version":"3.51.2"},"reference-count":18,"publisher":"American Mathematical Society (AMS)","issue":"360","license":[{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1225224"],"award-info":[{"award-number":["1225224"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1222524N"],"award-info":[{"award-number":["1222524N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1225224"],"award-info":[{"award-number":["1225224"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1222524N"],"award-info":[{"award-number":["1222524N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    The occupancy fraction of a graph is a (normalized) measure on the size of independent sets under the hard-core model, depending on a variable (fugacity)\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"lamda\">\n                        <mml:semantics>\n                          <mml:mi>\n                            \u03bb\n                            \n                          <\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">\\lambda<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . We present a criterion for finding the graph with minimum occupancy fraction among graphs with a fixed order. We computationally determine graphs having between 14 and 38 vertices that disprove five conjectures on the extremes of the occupancy fraction and (normalized) independence polynomial for certain graph classes of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"d\">\n                        <mml:semantics>\n                          <mml:mi>d<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">d<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -regular graphs with a given girth\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"g\">\n                        <mml:semantics>\n                          <mml:mi>g<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">g<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    .\n                  <\/p>","DOI":"10.1090\/mcom\/4121","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:14:55Z","timestamp":1750252495000},"page":"2091-2102","source":"Crossref","is-referenced-by-count":0,"title":["Counterexamples to conjectures on the occupancy fraction of graphs"],"prefix":"10.1090","volume":"95","author":[{"given":"Stijn","family":"Cambie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorik","family":"Jooken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2025,6,17]]},"reference":[{"issue":"5","key":"1","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1137\/050644033","article-title":"Accelerating simulated annealing for the permanent and combinatorial counting problems","volume":"37","author":"Bez\u00e1kov\u00e1, Ivona","year":"2008","journal-title":"SIAM J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"key":"2","unstructured":"S. Cambie and J. Jooken, Code and data for the paper \u201ccounterexamples to conjectures on the occupancy fraction of graphs\u201d, \\url{https:\/\/github.com\/JorikJooken\/occupancyFraction}, 2023."},{"key":"3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejc.2016.11.003","article-title":"The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph","volume":"62","author":"Cohen, Emma","year":"2017","journal-title":"European J. Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0195-6698","issn-type":"print"},{"key":"4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.dam.2022.10.013","article-title":"House of Graphs 2.0: a database of interesting graphs and more","volume":"325","author":"Coolsaet, Kris","year":"2023","journal-title":"Discrete Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0166-218X","issn-type":"print"},{"key":"5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jctb.2013.10.003","article-title":"The maximum number of complete subgraphs in a graph with given maximum degree","volume":"104","author":"Cutler, Jonathan","year":"2014","journal-title":"J. Combin. Theory Ser. B","ISSN":"https:\/\/id.crossref.org\/issn\/0095-8956","issn-type":"print"},{"issue":"3","key":"6","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.disc.2017.11.016","article-title":"Minimizing the number of independent sets in triangle-free regular graphs","volume":"341","author":"Cutler, Jonathan","year":"2018","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"issue":"1","key":"7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1112\/jlms.12056","article-title":"Independent sets, matchings, and occupancy fractions","volume":"96","author":"Davies, Ewan","year":"2017","journal-title":"J. Lond. Math. Soc. (2)","ISSN":"https:\/\/id.crossref.org\/issn\/0024-6107","issn-type":"print"},{"issue":"1","key":"8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/jgt.21658","article-title":"Maximizing \ud835\udc3b-colorings of a regular graph","volume":"73","author":"Galvin, David","year":"2013","journal-title":"J. Graph Theory","ISSN":"https:\/\/id.crossref.org\/issn\/0364-9024","issn-type":"print"},{"key":"9","isbn-type":"print","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1090\/dimacs\/063\/07","article-title":"On weighted graph homomorphisms","author":"Galvin, David","year":"2004","ISBN":"https:\/\/id.crossref.org\/isbn\/0821835513"},{"key":"10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2019.06.006","article-title":"A census of small transitive groups and vertex-transitive graphs","volume":"101","author":"Holt, Derek","year":"2020","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"3","key":"11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0963548301004631","article-title":"An entropy approach to the hard-core model on bipartite graphs","volume":"10","author":"Kahn, Jeff","year":"2001","journal-title":"Combin. Probab. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0963-5483","issn-type":"print"},{"issue":"2","key":"12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","article-title":"Fast generation of regular graphs and construction of cages","volume":"30","author":"Meringer, Markus","year":"1999","journal-title":"J. Graph Theory","ISSN":"https:\/\/id.crossref.org\/issn\/0364-9024","issn-type":"print"},{"key":"13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jctb.2018.04.009","article-title":"Counting independent sets in cubic graphs of given girth","volume":"133","author":"Perarnau, Guillem","year":"2018","journal-title":"J. Combin. Theory Ser. B","ISSN":"https:\/\/id.crossref.org\/issn\/0095-8956","issn-type":"print"},{"issue":"2","key":"14","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00222-020-00956-9","article-title":"A reverse Sidorenko inequality","volume":"221","author":"Sah, Ashwin","year":"2020","journal-title":"Invent. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-9910","issn-type":"print"},{"issue":"2","key":"15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jgt.22148","article-title":"Graph operations and upper bounds on graph homomorphism counts","volume":"87","author":"Sernau, Luke","year":"2018","journal-title":"J. Graph Theory","ISSN":"https:\/\/id.crossref.org\/issn\/0364-9024","issn-type":"print"},{"key":"16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.2307\/1998115","article-title":"Some Ramsey-type numbers and the independence ratio","volume":"256","author":"Staton, William","year":"1979","journal-title":"Trans. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9947","issn-type":"print"},{"issue":"2","key":"17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","article-title":"The number of independent sets in a regular graph","volume":"19","author":"Zhao, Yufei","year":"2010","journal-title":"Combin. Probab. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0963-5483","issn-type":"print"},{"issue":"9","key":"18","doi-asserted-by":"publisher","first-page":"827","DOI":"10.4169\/amer.math.monthly.124.9.827","article-title":"Extremal regular graphs: independent sets and graph homomorphisms","volume":"124","author":"Zhao, Yufei","year":"2017","journal-title":"Amer. Math. Monthly","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9890","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2026-95-360\/S0025-5718-2025-04121-8\/mcom4121_AM.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/www.ams.org\/mcom\/2026-95-360\/S0025-5718-2025-04121-8\/S0025-5718-2025-04121-8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:05:41Z","timestamp":1776837941000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2026-95-360\/S0025-5718-2025-04121-8\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":18,"journal-issue":{"issue":"360","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0025-5718-2025-04121-8"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/4121","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}