Abstract
We characterize pairs of convex setsA, B in thek-dimensional space with the property that every probability distribution (p 1,...,p k ) has a repsesentationp i =a l .b i , a∃A, b∃B.
Minimal pairs with this property are antiblocking pairs of convex corners. This result is closely related to a new entropy concept. The main application is an information theoretic characterization of perfect graphs.
Similar content being viewed by others
References
C. Berge:Graphs and hypergraphs, 2nd edition. North Holland, Amsterdam,1976.
V. Chvátal: On certain polytopes associated with graphs.J. Comb. Theory B,18 (1975) 138–154.
I. Csiszár andJ. Körner:Information Theory. Coding Theorems for Discrete Memoryless Systems. Academic Press, New York,1982.
D. R. Fulkerson: Blocking and anti-blocking pairs of polyhedra,Math. Programming,1 (1971), 168–194.
D. R. Fulkerson: On the perfect graph theorem. In:Mathematical Programming (T. C. Hu, S. M. Robinson, Eds), Academic Press, New York,1973, 69–77.
M.Grötschel, L.Lovász and A.Schrljver: Relaxations of vertex packing.J. Comb. Theory B,40 (86) 330–343.
J. Körner: Coding of an information source having ambiguous alphabet and the entropy of graphs. In:Transactions of the 6 th Prague Conference on Information Theory, etc., Academia, Prague,1973, 411–425.
J.Körner: An extension of the class of perfect graphs,Studia Sci. Math. Hung.,8 (73) 405–409.
J.Körner: Fredman-Komlós bounds and information theory,SIAM J. of Algebraic and Discrete Methods,7 (86) 560–570.
J.Körner and G.Longo: Two-step encoding of finite memoryless sources,IEEE Trans. on Inform. Theory,19 (73) 778–782.
J.Körner and K.Marton: New bounds for perfect hashing via information theory,European J. of Combinatorics, to appear.
J.Körner and K.Marton: Graphs that split entropy,SIAM J. on Discrete Mathematics, to appear.
J.Körner and A.Sgarro: A new approach to rate distorsion theory,Rend. Inst. Matem. Univ. di Trieste 18 (86), 117–187.
L.Lovász: On the Shannon capacity of a graph.,IEEE Trans. on Inform. Theory,25 (79) 1–7.
L. Lovász: Perfect graphs. In:More Selected Topics in Graph Theory (L. W. Beineke, R. J. Wilson eds), Academic Press, New York-London,1983, 55–87.
K.Marton: On the Shannon capacity of graphs within a given type;in preparation.
R. J. McEliece:The theory of information and coding, Addison-Wesley, Reading, Mass.1977.
Author information
Authors and Affiliations
Additional information
Research was partially sponsored by the Hungarian National Foundation, Scientific Research Grants No 1806 and 1812.
Rights and permissions
About this article
Cite this article
Csiszár, I., Körner, J., Lovász, L. et al. Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10, 27–40 (1990). https://doi.org/10.1007/BF02122693
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02122693