Entropy splitting for antiblocking corners and perfect graphs
- 1 March 1990
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 10 (1) , 27-40
- https://doi.org/10.1007/bf02122693
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- New Bounds for Perfect Hashing via Information TheoryEuropean Journal of Combinatorics, 1988
- Graphs that Split EntropiesSIAM Journal on Discrete Mathematics, 1988
- Fredman–Komlós bounds and information theorySIAM Journal on Algebraic Discrete Methods, 1986
- Relaxations of vertex packingJournal of Combinatorial Theory, Series B, 1986
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Two-step encoding for finite sourcesIEEE Transactions on Information Theory, 1973
- On the Perfect Graph TheoremPublished by Elsevier ,1973
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971