{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:27:44Z","timestamp":1759364864716,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejc.2011.09.027","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T19:13:00Z","timestamp":1319051580000},"page":"767-798","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["A superlinear bound on the number of perfect matchings in cubic bridgeless graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"Louis","family":"Esperet","sequence":"first","affiliation":[]},{"given":"Franti\u0161ek","family":"Kardo\u0161","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"unstructured":"M. Chudnovsky, P. Seymour, Perfect matchings in planar cubic graphs, Combinatorica (in press).","key":"10.1016\/j.ejc.2011.09.027_br000005"},{"key":"10.1016\/j.ejc.2011.09.027_br000010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with (0,1) vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/j.ejc.2011.09.027_br000015","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579233","article-title":"Brick decompositions and the matching rank of graphs","volume":"2","author":"Edmonds","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2011.09.027_br000020","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1016\/j.ejc.2009.11.008","article-title":"An improved linear bound on the number of perfect matchings in cubic graphs","volume":"31","author":"Esperet","year":"2010","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2011.09.027_br000025","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1137\/080723843","article-title":"A new lower bound on the number of perfect matchings in cubic graphs","volume":"23","author":"Kr\u00e1l\u2019","year":"2009","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2011.09.027_br000030","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(87)90021-9","article-title":"Matching structure and the matching lattice","volume":"43","author":"Lov\u00e1sz","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"year":"1986","author":"Lov\u00e1sz","series-title":"Matching Theory","key":"10.1016\/j.ejc.2011.09.027_br000035"},{"key":"10.1016\/j.ejc.2011.09.027_br000040","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01581025","article-title":"Rank of maximum matchings in a graph","volume":"22","author":"Naddef","year":"1982","journal-title":"Math. Program."},{"key":"10.1016\/j.ejc.2011.09.027_br000045","doi-asserted-by":"crossref","first-page":"#P62","DOI":"10.37236\/549","article-title":"Perfect matchings in claw-free cubic graphs","volume":"18","author":"Oum","year":"2011","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2011.09.027_br000050","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die theorie der regul\u00e4ren graphs","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta. Math."},{"key":"10.1016\/j.ejc.2011.09.027_br000055","first-page":"310","article-title":"Connectivity of regular graphs and the existence of 1-factors","volume":"22","author":"Plesn\u00edk","year":"1972","journal-title":"Mat. \u010casopis Slovens. Akad. Vied."},{"key":"10.1016\/j.ejc.2011.09.027_br000060","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/1385-7258(79)90012-X","article-title":"A lower bound for the permanents of certain (0,1)-matrices","volume":"41","author":"Voorhoeve","year":"1979","journal-title":"Nederl. Akad. Wetensch. Indag. Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669811001752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669811001752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T04:06:15Z","timestamp":1759291575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669811001752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0195669811001752"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2011.09.027","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2012,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A superlinear bound on the number of perfect matchings in cubic bridgeless graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2011.09.027","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2011 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}