Abstract
Denote by Ω={1,...,n} an n–element set. For all \(A,B\in\binom{\Omega}k\), the k–element subsets of Ω, define the relation ~ as follows:
A~B iff A and B have a common shadow, i.e. there is a \(C\in\binom{\Omega}{k-1}\) with C ⊂A and C ⊂B. For fixed integer α, our goal is to find a family \({\mathcal A}\) of k–subsets with size α, having as many as possible ~–relations for all pairs of its elements. For k=2 this was achieved by Ahlswede and Katona [2] many years ago.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N.: On edge-isoperimetric theorems for uniform hypergraphs, Preprint 93-018, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld (1993)
Ahlswede, R., Katona, G.: Graphs with maximal number of adjacent pairs of edges. Acta. Math. Sci. Hungaricae Tomus 32(1–2), 97–120 (1978)
Ahlswede, R., Katona, G.: Contributions to the geometry of Hamming spaces. Discrete Math. 17, 1–22 (1977)
Bollobás, B., Leader, I.: Edge–isoperimetric inequalities in the grid. Combinatorica 11(4), 299–314 (1991)
Harper, L.H.: Optimal assignments of numbers to vertices. SIAM J. Appl. Math. 12, 131–135 (1964)
Ahlswede, R.: Simple hypergraphs with maximal number of adjacent pairs of edges. J. Combinatorial Theory, Series B 28(2), 164–167 (1980)
Bezrukov, S.L., Boronin, V.P.: Extremal ideals of the lattice of multisets with respect to symmetric functionals (in Russian). Diskretnaya Matematika 2(1), 50–58 (1990)
Ahlswede, R., Alth”ofer, I.: The asymptotic behaviour of diameters in the average, Preprint 91–099, SFB 343, Diskrete Strukturen in der Mathematik. J. Combinatorial Theory B 61(2), 167–177 (1994)
Ahlswede, R., Cai, N.: On partitioning and packing products with rectangles. Combin. Probab. Comput. 3(4), 429–434 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Cai, N. (2006). Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_63
Download citation
DOI: https://doi.org/10.1007/11889342_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)