Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Given a set $A$ of $n$ elements and an positive integer $k\le n$, what is the size of the largest Sperner family $\mathcal{F}$ of subsets of $A$ such that $\mathcal{F}$ contains a set $B\subseteq A$ of size $k$?

I wonder whether it is just the family made of all subsets of $A$ of size $k$ (and why) or one can build a larger one.

share|improve this question
1  
If $k$ is much smaller than $n$, we can build set systems that contain a $k$-subset and larger than $\binom{n}{k}$. Keep the $k$-set apart. There will be a sperner family of length $\binom{n-k}{\lfloor \frac{n-k}{2} \rfloor}$. Then, append the $k$-set to it. (for example note that when $n=10,k=2$, this gives a longer antichain). But we need not stop here, much more subsets can be appended. The final answer might be broken into cases depending on $k$. Thanks for a good problem, it deserves special attention. –  talegari Jun 8 at 17:04
    
@talegari: thank you (again)! –  Matteo Jun 8 at 18:01
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.