KöMaL 2023 B5314

Let $S$ be an $n$-element set, and let $1\le k\le n$ be an odd integer. What is the largest number of subsets of $S$ that can be selected so that the symmetric difference of no pair of subsets should have exactly $k$ elements?