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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
