{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:22:24Z","timestamp":1782825744871,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T00:00:00Z","timestamp":1448668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s00493-014-3188-y","type":"journal-article","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T05:18:22Z","timestamp":1448687902000},"page":"703-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Graphs with the fewest matchings"],"prefix":"10.1007","volume":"36","author":[{"given":"Lauren","family":"Keough","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew J.","family":"Radcliffe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"3188_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R. Ahlswede","year":"1978","unstructured":"R. Ahlswede and G. O. H. Katona: Graphs with maximal number of adjacent pairs of edges, Acta Math. Acad. Sci. Hungar. 32 (1978), 97\u2013120.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"3188_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.37236\/888","volume":"15","author":"N. Alon","year":"2008","unstructured":"N. Alon and S. Friedland: The maximum number of perfect matchings in graphs with a given degree sequence, Electron. J. Combin. 15 (2008), Note 13, 2.","journal-title":"Electron. J. Combin."},{"key":"3188_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s: Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"3188_CR4","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00493-009-2366-9","volume":"29","author":"W. Cuckler","year":"2009","unstructured":"W. Cuckler and J. Kahn: Entropy bounds for perfect matchings and Hamiltonian cycles, Combinatorica 29 (2009), 327\u2013335.","journal-title":"Combinatorica"},{"key":"3188_CR5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.37236\/497","volume":"18","author":"J. Cutler","year":"2011","unstructured":"J. Cutler and A. J. Radcliffe: An entropy proof of the Kahn-Lov\u00e1sz theorem, Electron. J. Combin. 18 (2011), Paper 10, 9.","journal-title":"Electron. J. Combin."},{"key":"3188_CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.20530","volume":"67","author":"J. Cutler","year":"2011","unstructured":"J. Cutler and A. J. Radcliffe: Extremal graphs for homomorphisms, J. Graph Theory 67 (2011), 261\u2013284.","journal-title":"J. Graph Theory"},{"key":"3188_CR7","volume-title":"Journal of Graph Theory","author":"J. Cutler","year":"2013","unstructured":"J. Cutler and A. J. Radcliffe: Extremal graphs for homomorphismsii, Journal of Graph Theory (2013)."},{"key":"3188_CR8","first-page":"413","volume-title":"Combinatorial theory and its applications","author":"D. Foata","year":"1970","unstructured":"D. Foata and M. P. Sch\u00fctzenberger: On the rook polynomials of Ferrers relations, in: Combinatorial theory and its applications, II (Proc. Colloq., Balatonflured, 1969), North-Holland, Amsterdam, 1970, 413\u2013436."},{"key":"3188_CR9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.37236\/834","volume":"15","author":"S. Friedland","year":"2008","unstructured":"S. Friedland, E. Krop and K. Markstr\u00f6m: On the number of matchings in regular graphs, Electron. J. Combin. 15 (2008), Research Paper 110, 28.","journal-title":"Electron. J. Combin."},{"key":"3188_CR10","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.disc.2009.08.016","volume":"310","author":"D. Gross","year":"2010","unstructured":"D. Gross, N. Kahl and J. T. Saccoman: Graphs with the maximum or minimum number of 1-factors, Discrete Math. 310 (2010), 687\u2013691.","journal-title":"Discrete Math"},{"key":"3188_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"P. L. Hammer","year":"1990","unstructured":"P. L. Hammer, U. N. Peled and X. Sun: Dierence graphs, Discrete Appl. Math. 28 (1990), 35\u201344.","journal-title":"Discrete Appl. Math."},{"key":"3188_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J. Kahn","year":"2001","unstructured":"J. Kahn: An entropy approach to the hard-core model on bipartite graphs, Combin. Probab. Comput. 10 (2001), 219\u2013237.","journal-title":"Combin. Probab. Comput."},{"key":"3188_CR13","volume-title":"Annals of Discrete Mathematics","author":"N. V. R. Mahadev","year":"1995","unstructured":"N. V. R. Mahadev and U. N. Peled: Threshold graphs and related topics, Annals of Discrete Mathematics, vol. 56, North-Holland Publishing Co., Amsterdam, 1995."},{"key":"3188_CR14","volume-title":"An introduction to combinatorial analysis","author":"J. Riordan","year":"2002","unstructured":"J. Riordan: An introduction to combinatorial analysis, Dover Publications Inc., Mineola, NY, 2002, Reprint of the 1958 original [Wiley, New York]."},{"key":"3188_CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"M. Yannakakis: The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Methods 3 (1982), 351\u2013358.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"3188_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y. Zhao","year":"2010","unstructured":"Y. Zhao: The number of independent sets in a regular graph, Combin. Probab. Comput. 19 (2010), 315\u2013320.","journal-title":"Combin. Probab. Comput."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3188-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3188-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T00:49:19Z","timestamp":1599871759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3188-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,28]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["3188"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3188-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,28]]}}}