Martin Büttnerless info
|location||London, United Kingdom|
|visits||member for||1 year, 9 months|
|seen||2 days ago|
Software engineer, physicist, and computer graphics/game enthusiast.
How can I find the smallest set of groups of $n$ elements such that every element is in the same group as every other at least once?
I'm pretty sure the sum you figured out for n = 2 is exactly the same as L-choose-2. There could be a smaller number for n > 2, though.