Abstract
Among all collections of a given number of k-element subsets of an n-element groundset find a collection which maximizes the number of pairs of subsets which intersect in k -1 elements. This problem was solved for k = 2 by Ahlswede and Katona, and is open for k > 2. We survey some linear algebra approaches which yield to estimations for the maximum number of pairs, and we present another short proof of the Ahlswede-Katona result. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bey, C. (2006). Remarks on an edge isoperimetric problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4123 LNCS, pp. 971–978). https://doi.org/10.1007/11889342_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
