Timeline for Maximal "Spot It!" card count
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 28, 2014 at 7:57 | comment | added | Peter Dukes | In the actual card game, any two distinct cards have exactly one symbol in common. This is Ray Chaudhuri-Wilson (as mentioned in the stackedchange solution). Your variation, in which any two cards have at least one symbol in common, connects with the Erd\H{o}s-Ko-Rado theorem. Masked Avenger's answer, which I'll rewrite as $\binom{n-1}{k-1}$, is the maximum for all $n \ge 2k$. | |
Apr 25, 2014 at 1:42 | comment | added | The Masked Avenger | For n=2k, exactly half of the sets are allowed or $\binom{n-1}{k}$. | |
Apr 24, 2014 at 23:52 | comment | added | Ira Gessel | See, e.g., math.stackexchange.com/questions/36798/… and stackoverflow.com/questions/6240113/…. | |
Apr 24, 2014 at 23:30 | history | asked | Michael | CC BY-SA 3.0 |