{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:42:23Z","timestamp":1648762943571},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01787419","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T19:01:11Z","timestamp":1119207671000},"page":"29-48","source":"Crossref","is-referenced-by-count":1,"title":["On the capacity of boolean graph formul\u00e6"],"prefix":"10.1007","volume":"11","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"K\u00f6rner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01787419_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eplicit construction of exponentially sized families ofk-independent sets, Discret Math.58, 191\u2013193 (1986)","journal-title":"Discret Math."},{"key":"BF01787419_CR2","first-page":"76","volume":"4","author":"R. Ahlswede","year":"1979","unstructured":"Ahlswede, R.: Coloring hypergraphs: A new approach to multi-user source coding, J. Comb. Inf. Syst. Sci. pt. I,4, 76\u2013115 (1979)","journal-title":"J. Comb. Inf. Syst. Sci. pt. I"},{"key":"BF01787419_CR3","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"Berge, C.: Graphs, 2nd revised edition, North-Holland, Amsterdam (1985)","edition":"2nd revised edi"},{"key":"BF01787419_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1022424630332","volume":"2","author":"A.R. Calderbank","year":"1993","unstructured":"Calderbank, A.R., Graham, R.L., Shepp, L.A., Frank., P., Li, W.-C. W.: The cyclic triangle problem, J. Alg. Combinatorics2, 31\u201348 (1993)","journal-title":"J. Alg. Combinatorics"},{"key":"BF01787419_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, G., K\u00f6rner, J., Simonyi, G.: Zero-error capacities and very different sequences, In: Sequences: combinatorics, compression, security and transmission, R.M. Capocelli (Ed.), Springer-Verlag, pp. 144\u2013155 (1990)","DOI":"10.1007\/978-1-4612-3352-7_11"},{"key":"BF01787419_CR6","volume-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1982","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, (1982) and Akad\u00e9miai Kiad\u00f3, Budapest, (1981)"},{"key":"BF01787419_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02122693","volume":"10","author":"I. Csisz\u00e1r","year":"1990","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J., Lov\u00e1sz, L. Marton, K., Simonyi, G.: Entropy splitting for antiblocking corners and perfect graphs, Combinatorica10, 27\u201340 (1990)","journal-title":"Combinatorica"},{"key":"BF01787419_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0097-3165(92)90016-N","volume":"61","author":"L. Gargano","year":"1992","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Qualitative independence and Sperner problems on directed graphs, J. Comb. Theory Ser. A61, 173\u2013192 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"key":"BF01787419_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01195325","volume":"9","author":"L. Gargano","year":"1993","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Sperner capacities, Graphs and Combinatorics9, 31\u201346 (1993)","journal-title":"Graphs and Combinatorics"},{"key":"BF01787419_CR10","doi-asserted-by":"crossref","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Capacities: from information theory to extremal set theory, J. Comb. Theory, Ser. A (to be published)","DOI":"10.1016\/0097-3165(94)90108-2"},{"issue":"3","key":"BF01787419_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02018457","volume":"1\u20132","author":"G.O.H. Katona","year":"1973","unstructured":"Katona, G.O.H.: Two applications (for search theory and truth functions) of Sperner type theorems, Periodica Math. Hung.,1\u20132(3, 19\u201326 (1973)","journal-title":"Periodica Math. Hung."},{"key":"BF01787419_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D. Kleitman","year":"1973","unstructured":"Kleitman, D., Spencer, J.: Families ofk-independent sets, Discrete Math.6, 255\u2013262 (1973)","journal-title":"Discrete Math."},{"key":"BF01787419_CR13","first-page":"411","volume-title":"Transactions of the 6th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, 1971","author":"J. K\u00f6rner","year":"1973","unstructured":"K\u00f6rner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs, In Transactions of the 6th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, 1971, Academia, Prague, pp. 411\u2013425 (1973)"},{"key":"BF01787419_CR14","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0607062","volume":"47","author":"J. K\u00f6rner","year":"1986","unstructured":"K\u00f6rner, J.: Fredman-Koml\u00f3s bounds and information theory, SIAM J. on Algebraic and Discrete Meth.47, 560\u2013570 (1986)","journal-title":"SIAM J. on Algebraic and Discrete Meth."},{"key":"BF01787419_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6rner, J.: Intersection number and capacities of graphs, Discrete Math. (to be published)","DOI":"10.1016\/0012-365X(95)00011-K"},{"key":"BF01787419_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0401008","volume":"11","author":"J. K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Marton, K.: Graphs that split entropies, SIAM J. Discrete Math.11, 71\u201379 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"BF01787419_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(92)90100-9","volume":"59","author":"J. K\u00f6rner","year":"1992","unstructured":"K\u00f6rner, J., Simonyi, G.: A Sperner-type theorem and qualitative independence, J. Comb. Theory, Ser. A59, 90\u2013103 (1992)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"BF01787419_CR18","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers, Discrete Math.13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"BF01787419_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph, IEEE Trans. on Information TheoryIT-25, 1\u20137 (1979)","journal-title":"IEEE Trans. on Information Theory"},{"key":"BF01787419_CR20","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A.W. Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, (1979)"},{"key":"BF01787419_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jctb.1993.1015","volume":"57","author":"K. Marton","year":"1993","unstructured":"Marton, K.: On the Shannon capacity of probabilistic graphs, J. Comb. Theory, Ser. B57, 183\u2013195 (1993)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"BF01787419_CR22","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications, Proceedings of ACM STOC'90, pp. 213\u2013223","DOI":"10.1145\/100216.100244"},{"key":"BF01787419_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(83)90072-0","volume":"6","author":"S. Poljak","year":"1983","unstructured":"Poljak, S., Pultr, A., R\u00f6dl, V.: On qualitatively independent partitions and related problems, Discr. Appl. Math.6, 193\u2013205 (1983)","journal-title":"Discr. Appl. Math."},{"key":"BF01787419_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0097-3165(89)90081-2","volume":"51","author":"S. Poljak","year":"1989","unstructured":"Poljak, S., Tuza, Z.: On the maximum number of qualitatively independent partitions, J. Comb. Theor, Ser. A51, 11\u2013116 (1989)","journal-title":"J. Comb. Theor, Ser. A"},{"key":"BF01787419_CR25","volume-title":"Foundations of Probability","author":"A. R\u00e9nyi","year":"1971","unstructured":"R\u00e9nyi, A.: Foundations of Probability, Wiley, New York, (1971)"},{"key":"BF01787419_CR26","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/18.6031","volume":"IT-34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits, IEEE Trans. Inform. TheoryIT-34, 513\u2013521 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF01787419_CR27","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"2","author":"C.E. Shannon","year":"1956","unstructured":"Shannon, C.E.: The zero-error capacity of a noisy channel, IRE Trans. on Information Theory2, 8\u201319 (1956)","journal-title":"IRE Trans. on Information Theory"},{"key":"BF01787419_CR28","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0097-3165(74)90062-4","volume":"16","author":"S.K. Stein","year":"1974","unstructured":"Stein, S.K.: Two combinatorial covering theorems, J. Comb. Theory, Ser. A16, 391\u2013397 (1974)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"BF01787419_CR29","doi-asserted-by":"crossref","unstructured":"Tuza, Z.: Intersection properties and extremal problems for set systems, In: Irregularities of Partitions, G. Hal\u00e1sz and V.T. S\u00f3s (Eds.), Algorithms and Combinatorics8, Springer Verlag, pp. 141\u2013151 (1989)","DOI":"10.1007\/978-3-642-61324-1_13"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787419.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787419\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:17Z","timestamp":1557493937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01787419"],"URL":"https:\/\/doi.org\/10.1007\/bf01787419","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}