{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T04:45:58Z","timestamp":1767156358430},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10273,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/s0166-218x(85)80003-2","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T20:06:18Z","timestamp":1121198778000},"page":"115-128","source":"Crossref","is-referenced-by-count":51,"title":["Minimum matrix representation of closure operations"],"prefix":"10.1016","volume":"11","author":[{"given":"J.","family":"Demetrovics","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"F\u00fcredi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.O.H.","family":"Katona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(85)80003-2_bib1","first-page":"580","article-title":"Dependency structures of data base relationship","volume":"74","author":"Armstrong","year":"1974"},{"key":"10.1016\/S0166-218X(85)80003-2_bib2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(80)90108-9","article-title":"On the number of maximal dependencies in a data base relation of fixed order","volume":"30","author":"B\u00e9k\u00e9ssy","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(85)80003-2_bib3","first-page":"1","article-title":"Logical investigation of the relational date model in view of functional dependency (in Hungarian)","volume":"109","author":"B\u00e9k\u00e9ssy","year":"1980","journal-title":"MTA SZTAKI Tanulm\u00e1nyok"},{"key":"10.1016\/S0166-218X(85)80003-2_bib4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm ACM"},{"key":"10.1016\/S0166-218X(85)80003-2_bib5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1137\/0601012","article-title":"Candidate keys and antichains","volume":"1","author":"Demetrovics","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(85)80003-2_bib6","first-page":"247","article-title":"On the equivalence of candidate keys with Sperner systems","volume":"4","author":"Demetrovics","year":"1979","journal-title":"Acta Cybernetica (Szeged)"},{"key":"10.1016\/S0166-218X(85)80003-2_bib7","first-page":"295","article-title":"On the functional dependency and some generalization of it","volume":"5","author":"Demetrovics","year":"1981","journal-title":"Acta Cybernetica"},{"key":"10.1016\/S0166-218X(85)80003-2_bib8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02579291","article-title":"A note on minimal matrix representation of closure operations","volume":"3","author":"Demetrovics","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(85)80003-2_bib9","first-page":"110","article-title":"Extremal combinatorial problems in relational data base","volume":"117","author":"Demetrovics","year":"1981"},{"key":"10.1016\/S0166-218X(85)80003-2_bib10","first-page":"23","article-title":"Minimum relational data bases (in Hungarian)","volume":"9","author":"F\u00fcredi","year":"1983","journal-title":"Alk. Mat. Lapok"},{"key":"10.1016\/S0166-218X(85)80003-2_bib11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1214\/aoms\/1177705047","article-title":"The existence and construction of balanced incomplete block designs","volume":"32","author":"Hanani","year":"1961","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0166-218X(85)80003-2_bib12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0097-3165(74)90093-4","article-title":"On resolvable balanced incomplete block designs","volume":"17","author":"Hanani","year":"1974","journal-title":"J. Combin. Theory (A)"},{"key":"10.1016\/S0166-218X(85)80003-2_bib13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:14Z","timestamp":1548345254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X85800032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["S0166218X85800032"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(85)80003-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}