{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:59Z","timestamp":1725493439240},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432203"},{"type":"electronic","value":"9783540457589"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45758-5_13","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T15:32:20Z","timestamp":1193326340000},"page":"197-211","source":"Crossref","is-referenced-by-count":0,"title":["Extremal Theorems for Databases"],"prefix":"10.1007","author":[{"given":"Kriszti\u00e1n","family":"Tichler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,5]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (North Holland, Amsterdam, 1974) 580\u2013583.","DOI":"10.1515\/9783110840308-026"},{"issue":"1\u20133","key":"13_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(96)00051-0","volume":"81","author":"F.E. Bennett","year":"1998","unstructured":"F.E. Bennett, LiSheng Wu, Minimum matrix representation of Sperner-systems, Discrete Appl. Math. 81 (1998), no. 1\u20133., 9\u201317.","journal-title":"Discrete Appl. Math."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(90)90018-8","volume":"26","author":"F.E. Bennett","year":"1990","unstructured":"F.E. Bennett, LiSheng Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25\u201340.","journal-title":"Discrete Appl. Math."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/0601012","volume":"1","author":"J. Demetrovics","year":"1980","unstructured":"J. Demetrovics, Candidate keys and antichains, SIAM J. Algebraic Methods 1 (1980) 92.","journal-title":"SIAM J. Algebraic Methods"},{"key":"13_CR5","first-page":"247","volume":"4","author":"J. Demetrovics","year":"1979","unstructured":"J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4 (1979) 247\u2013252.","journal-title":"Acta Cybernet"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(85)80003-2","volume":"11","author":"J. Demetrovics","year":"1985","unstructured":"J. Demetrovics, Z. F\u00fcredi, G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115\u2013128.","journal-title":"Discrete Appl. Math."},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-10854-8_11","volume-title":"Fundamentals of Computation Theory","author":"J. Demetrovics","year":"1981","unstructured":"J. Demetrovics, G.O.H. Katona, Extremal combinatorial problems in relational database, in Fundamentals of Computation Theory 81, Proc. of the 1981 International FCT-Conference, Szeged, Hungary, 1981, Lecture Notes in Computer Science 117 (Springer, Berlin 1981) 110\u2013119."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90114-R","volume":"28","author":"Z. F\u00fcredi","year":"1990","unstructured":"Z. F\u00fcredi, Perfect error-correcting databases, Discrete Appl. Math. 28 (1990) 171\u2013176.","journal-title":"Discrete Appl. Math."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/jgt.3190110403","volume":"11","author":"Z. F\u00fcredi","year":"1987","unstructured":"Z. F\u00fcredi, The Number of Maximal Independent Sets in Connected Graphs, Journal of Graph Theory 11 (1987) 463\u2013470.","journal-title":"Journal of Graph Theory"},{"issue":"2\u20133","key":"13_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0012-365X(91)90006-N","volume":"88","author":"B. Ganter","year":"1991","unstructured":"B. Ganter, H-D.O.F. Gronau, Two conjectures of Demetrovics, F\u00fcredi and Katona, concerning partitions, Combinatorics of ordered sets (Oberwolfach, 1988), Discrete Math. 88 (1991), no. 2\u20133., 149\u2013155.","journal-title":"Discrete Math."},{"issue":"2\u20133","key":"13_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(88)90114-8","volume":"68","author":"J.R. Griggs","year":"1988","unstructured":"J.R. Griggs, C.M. Grinstead, D.R. Guichard, The maximum number of maximal independent sets in a connected graph, Discrete Math. 68 (1988), no. 2\u20133., 211\u2013220.","journal-title":"Discrete Math."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0406022","volume":"6","author":"M. Hujter","year":"1993","unstructured":"M. Hujter, Zs. Tuza, The number of maximal independent sets in triangle-free graphs, SIAM J. Discrete Math. 6 (1993), no. 2, 284\u2013288.","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR13","series-title":"Lecture Notes in Comput. Science","first-page":"1","volume-title":"Database Theory-ICDT\u2019 92","author":"G.O.H. Katona","year":"1992","unstructured":"G.O.H. Katona, Combinatorial and algebraic results for database relations, in J. Biskup, R. Hull, ed., Database Theory-ICDT\u2019 92, Berlin, 1992, Lecture Notes in Comput. Science, 646 (Springer Verlag, Berlin, 1992) 1\u201320."},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/jgt.3190170407","volume":"17","author":"J. Liu","year":"1993","unstructured":"Jiuqiang Liu, Maximal independent sets in bipartite graphs. J. Graph Theory 17 (1993), no. 4, 495\u2013507.","journal-title":"J. Graph Theory"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"J.W. Moon, L. Moser, On cliques in graphs, Israel J. Math. 3 (1965) 23\u201328.","journal-title":"Israel J. Math."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1137\/0401012","volume":"1","author":"B.E. Sagan","year":"1988","unstructured":"B.E. Sagan, A note on independent sets in trees, SIAM J. Discrete Math. 1 (1988) 105\u2013108.","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-46564-2_17","volume-title":"Minimum matrix representation of some key systems","author":"K. Tichler","year":"2000","unstructured":"K. Tichler, Minimum matrix representation of some key systems, in K.-D. Schewe, B. Thalheim ed., Proc. of FoIKS 2000 Conference, Burg, Germany, 2000, Lecture Notes in Computer Science 1762 (Springer-Verlag, Berlin, 2000) 275\u2013287."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"H.S. Wilf","year":"1986","unstructured":"H.S. Wilf, The number of maximal independent sets in a tree, SIAM J. Alg. Disc. Meth. 7 (1986) 125\u2013130.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45758-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T07:58:54Z","timestamp":1587974334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45758-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432203","9783540457589"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45758-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}