{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:20:00Z","timestamp":1648603200327},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"vor","delay-in-days":11882,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1981,3]]},"DOI":"10.1016\/s0195-6698(81)80016-9","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T19:21:51Z","timestamp":1378927311000},"page":"17-20","source":"Crossref","is-referenced-by-count":3,"title":["On Haber's Minimum Term Rank Formula"],"prefix":"10.1016","volume":"2","author":[{"given":"Richard A.","family":"Brualdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(81)80016-9_bib1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0024-3795(80)90228-1","article-title":"On Ryser's maximum term rank formula","volume":"29","author":"Brualdi","year":"1980","journal-title":"Linear Algebra and Appl."},{"key":"10.1016\/S0195-6698(81)80016-9_bib2","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0195-6698(81)80016-9_bib3","first-page":"24","article-title":"Term rank of 0,1 matrices","volume":"30","author":"Haber","year":"1960","journal-title":"Rend. Sem. Mat. Univ. Padova"},{"key":"10.1016\/S0195-6698(81)80016-9_bib4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.4153\/CJM-1963-022-9","article-title":"Minimal term rank of a class of (0,1)-matrices","volume":"15","author":"Haber","year":"1963","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0195-6698(81)80016-9_bib5","series-title":"Transversal Theory","author":"Mirsky","year":"1971"},{"key":"10.1016\/S0195-6698(81)80016-9_bib6","doi-asserted-by":"crossref","first-page":"462","DOI":"10.4153\/CJM-1960-040-0","article-title":"Traces of matrices of zeros and ones","volume":"12","author":"Ryser","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0195-6698(81)80016-9_bib7","series-title":"Carus Math. Monograph No. 14","article-title":"Combinatorial Mathematics,","author":"Ryser","year":"1963"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669881800169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669881800169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T05:22:39Z","timestamp":1539408159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669881800169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,3]]}},"alternative-id":["S0195669881800169"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(81)80016-9","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1981,3]]}}}