{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:29:50Z","timestamp":1769689790926,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00493-009-2366-9","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T09:50:52Z","timestamp":1246528252000},"page":"327-335","source":"Crossref","is-referenced-by-count":10,"title":["Entropy bounds for perfect matchings and Hamiltonian cycles"],"prefix":"10.1007","volume":"29","author":[{"given":"Bill","family":"Cuckler","sequence":"first","affiliation":[]},{"given":"Jeff","family":"Kahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,3]]},"reference":[{"key":"2366_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and S. Friedland: The maximum number of perfect machings in graphs with a given degree sequence, Elec. J. Combinatorics 15 (2008), #N13.","DOI":"10.37236\/888"},{"key":"2366_CR2","first-page":"945","volume":"14","author":"L. Br\u00e9gman","year":"1973","unstructured":"L. Br\u00e9gman: Some properties of nonnegative matrices and their permanents, Math. Doklady 14 (1973), 945\u2013949.","journal-title":"Math. Doklady"},{"key":"2366_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"48","author":"F. R. K. Chung","year":"1986","unstructured":"F. R. K. Chung, P. Frankl, R. Graham and J. B. Shearer: Some intersection theorems for ordered sets and graphs, J. Combin. Theory Ser. A 48 (1986), 23\u201337.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2366_CR4","volume-title":"Information theory. Coding theorems for discrete memoryless systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner: Information theory. Coding theorems for discrete memoryless systems; Akad\u00e9miai Kiad\u00f3, Budapest, 1981."},{"key":"2366_CR5","doi-asserted-by":"crossref","unstructured":"B. Cuckler: Hamiltonian cycles in regular tournaments and Dirac graphs, Ph.D. thesis, Rutgers University, 2006.","DOI":"10.1017\/S0963548306008170"},{"issue":"3","key":"2366_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00493-009-2360-2","volume":"29","author":"B. Cuckler","year":"2009","unstructured":"B. Cuckler and J. Kahn: Hamiltonian cycles in Dirac graphs, Combinatorica 29(3) (2009), 299\u2013326.","journal-title":"Combinatorica"},{"key":"2366_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems on abstract graphs, Proc. London Math. Soc., Third Series 2 (1952), 69\u201381.","journal-title":"Proc. London Math. Soc., Third Series"},{"key":"2366_CR8","volume-title":"Permanents","author":"G. P. Egorychev","year":"2007","unstructured":"G. P. Egorychev: Permanents (Russian), Krasnoyarsk, SFU, 2007."},{"key":"2366_CR9","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, Combinatorics, Probability and Computing 10 (2001), 219\u2013237.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2366_CR10","volume-title":"The theory of information and coding","author":"R. J. McEliece","year":"1977","unstructured":"R. J. McEliece: The theory of information and coding, Addison-Wesley, London, 1977."},{"key":"2366_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcta.1996.2727","volume":"77","author":"J. Radhakrishnan","year":"1997","unstructured":"J. Radhakrishnan: An entropy proof of Bregman\u2019s Theorem, J. Combin. Theory Ser. A 77 (1997), 161\u2013164.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2366_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0012-365X(02)00582-4","volume":"265","author":"G. S\u00e1rk\u00f6zy","year":"2003","unstructured":"G. S\u00e1rk\u00f6zy, S. Selkow and E. Szemer\u00e9di: On the number of Hamiltonian cycles in Dirac graphs, Discrete Math. 265 (2003), 237\u2013250.","journal-title":"Discrete Math."},{"issue":"1","key":"2366_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0097-3165(78)90036-5","volume":"25","author":"A. Schrijver","year":"1978","unstructured":"A. Schrijver: A short proof of Minc\u2019s conjecture, J. Combin. Theory Ser. A 25(1) (1978), 80\u201383.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2366-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2366-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2366-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T05:29:50Z","timestamp":1589952590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2366-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["2366"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2366-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}