We characterize pairs of convex sets A, B in the k-dimensional space with the property that every probability distribution (p1,..., pk) has a repsesentation pi=al. bi, 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.
- AMS subject classification (1980): 05C15
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics