Abstract
In a recent paper we have solved several well-known combinatorial problems treating them as special cases of our generalization of Shannon's notion of graph capacity. We present a new simple formalism to deal with all such problems in a unified manner, considering graphs or families of graphs as special formulæ the variables of which are pairs of vertices of their common vertex sets. In all of these problems, the maximum size of a set ofn-length sequences from a fixed alphabet is to be determined under various restrictions on the element pairs present in the same coordinate of any two sequences from the set. For sufficiently homogeneous formulæ capacity becomes computable.
New applications include generalizations of our result on the maximum number of pairwise qualitatively independentk-partitions of ann-set from independence to various forms of qualitative dependence.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N.: Eplicit construction of exponentially sized families ofk-independent sets, Discret Math.58, 191–193 (1986)
Ahlswede, R.: Coloring hypergraphs: A new approach to multi-user source coding, J. Comb. Inf. Syst. Sci. pt. I,4, 76–115 (1979)
Berge, C.: Graphs, 2nd revised edition, North-Holland, Amsterdam (1985)
Calderbank, A.R., Graham, R.L., Shepp, L.A., Frank., P., Li, W.-C. W.: The cyclic triangle problem, J. Alg. Combinatorics2, 31–48 (1993)
Cohen, G., Körner, 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–155 (1990)
Csiszár, I., Körner, J.: Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, (1982) and Akadémiai Kiadó, Budapest, (1981)
Csiszár, I., Körner, J., Lovász, L. Marton, K., Simonyi, G.: Entropy splitting for antiblocking corners and perfect graphs, Combinatorica10, 27–40 (1990)
Gargano, L., Körner, J., Vaccaro, U.: Qualitative independence and Sperner problems on directed graphs, J. Comb. Theory Ser. A61, 173–192 (1992)
Gargano, L., Körner, J., Vaccaro, U.: Sperner capacities, Graphs and Combinatorics9, 31–46 (1993)
Gargano, L., Körner, J., Vaccaro, U.: Capacities: from information theory to extremal set theory, J. Comb. Theory, Ser. A (to be published)
Katona, G.O.H.: Two applications (for search theory and truth functions) of Sperner type theorems, Periodica Math. Hung.,1–2(3, 19–26 (1973)
Kleitman, D., Spencer, J.: Families ofk-independent sets, Discrete Math.6, 255–262 (1973)
Körner, 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–425 (1973)
Körner, J.: Fredman-Komlós bounds and information theory, SIAM J. on Algebraic and Discrete Meth.47, 560–570 (1986)
Körner, J.: Intersection number and capacities of graphs, Discrete Math. (to be published)
Körner, J., Marton, K.: Graphs that split entropies, SIAM J. Discrete Math.11, 71–79 (1988)
Körner, J., Simonyi, G.: A Sperner-type theorem and qualitative independence, J. Comb. Theory, Ser. A59, 90–103 (1992)
Lovász, L.: On the ratio of optimal integral and fractional covers, Discrete Math.13, 383–390 (1975)
Lovász, L.: On the Shannon capacity of a graph, IEEE Trans. on Information TheoryIT-25, 1–7 (1979)
Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, (1979)
Marton, K.: On the Shannon capacity of probabilistic graphs, J. Comb. Theory, Ser. B57, 183–195 (1993)
Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications, Proceedings of ACM STOC'90, pp. 213–223
Poljak, S., Pultr, A., Rödl, V.: On qualitatively independent partitions and related problems, Discr. Appl. Math.6, 193–205 (1983)
Poljak, S., Tuza, Z.: On the maximum number of qualitatively independent partitions, J. Comb. Theor, Ser. A51, 11–116 (1989)
Rényi, A.: Foundations of Probability, Wiley, New York, (1971)
Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits, IEEE Trans. Inform. TheoryIT-34, 513–521 (1988)
Shannon, C.E.: The zero-error capacity of a noisy channel, IRE Trans. on Information Theory2, 8–19 (1956)
Stein, S.K.: Two combinatorial covering theorems, J. Comb. Theory, Ser. A16, 391–397 (1974)
Tuza, Z.: Intersection properties and extremal problems for set systems, In: Irregularities of Partitions, G. Halász and V.T. Sós (Eds.), Algorithms and Combinatorics8, Springer Verlag, pp. 141–151 (1989)
Author information
Authors and Affiliations
Additional information
Work partially supported by the Italian Ministry of the University and Scientific Research, Project: Algoritmi, Modelli di Calcolo e Strutture Informative.
Rights and permissions
About this article
Cite this article
Gargano, L., Körner, J. & Vaccaro, U. On the capacity of boolean graph formulæ. Graphs and Combinatorics 11, 29–48 (1995). https://doi.org/10.1007/BF01787419
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787419