General edge-isoperimetric inequalities, part I: Information-theoretical methods

European Journal of Combinatorics

Volumn 18, Issue 4, 1997, Pages 355-372

  Ahlswede, Rudolf ^a   Cai, Ning ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21744457553     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0105     Document Type: Article

References (22)

1. R. Ahlswede and I. Althöfer, The asymptotic behaviour of diameters in the average, J. Combin. Theory, Ser. B, 61 (1994), 167-177.
2. R. Ahlswede and S. L. Berzrukov, Edge isoperimetric theorems for integer point arrays, Appl. Math. Letts., 8 (1995), 75-80.
3. R. Ahlswede and N. Cai, Models of multi-user write-efficient memories and general diametric theorems, SFB 'Diskrete Strukturen in der Mathematik', Bielefeld, Preprint 93-019, to appear in Information and Computation.
4. R. Ahlswede, N. Cai and Z. Zhang, Diametric theorems in sequence spaces, Combinatorica, 12 (1992), 1-17.
5. R. Ahlswede and G. Katona, Contributions to the geometry of Hamming spaces, Discr. Math., 17 (1977), 1-22.
6. R. Ahlswede and G. Katona, Graphs with minimal number of adjacent pairs of edges, Acta Math. Hungar., 32 (1978), 97-120.
7. R. Ahlswede and J. Körner, Source coding with side information and a converse for degraded broadcast channels, IEEE Trans. Inform. Theory, IT-21 (1975), 629-637.
8. A. J. Bernstein, Maximally connected arrays on the n-cube, SIAM J. Appl. Math., 15 (1967), 1485-1489.
9. B. Bollobás and I. Leader, Compressions and isoperimetric inequalities, J. Combin. Theory, Ser. A, 56 (1991), 47-62.
10. B. Bollobás and I. Leader, Edge-isoperimetric inequalities in the grid, Combinatorica, 11 (1991), 299-314.
11. C. F. Clements, Sets of lattice points which contain a maximal number of edges, Proc. Am. Math. Soc., 27 (1971), 13-15.
12. G. F. Clements and B. Lindström, A generalization of a combinatorial theorem of Macaulay, J. Combin. Theory, 7 (1969), 230-238.
13. H. G. Eggleston, Convexity, Cambridge University Press, Cambridge, 1958.
14. P. Frankl, The shifting technique in extremal set theory, in Surverys in Combinatorics 1987, C. Whitehead (ed.), London Math. Soc. Lecture Note Ser. 123, Cambridge University Press, 1987, pp. 81-110.
15. L. H. Harper, A necessary condition on minimal cube numberings, J. Appl. Prob., 4 (1967), 397-401.
16. L. H. Harper, Optimal assignment of numbers to vertices, SIAM J. Appl. Math., 12 (1964), 131-135.
17. S. Hart, A note on the edges of the n-cube, Discr. Math., 14 (1976), 157-163.
18. D. J. Kleitman, M. M. Krieger and B. L. Rothschild, Configurations maximizing the number of pairs of Hamming-adjacent lattice points, Stud. Appl. Math., 50 (1971), 115-119.
19. J. B. Kruskal, The number of s-dimensional faces in a complex: an analogy between the simplex and the cube, J. Combin. Theory, 6 (1969), 86-89.
20. J. H. Lindsey, Assignment of numbers to vertices, Am. Math. Monthly, 7 (1964), 508-516.
21. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, 1979.
22. M. Salehi, Cardinality bounds on auxiliary variables in multiple-user theory via the method of Ahlswede and Körner, Stanford Technical Report, 1978.