Timeline for The number of a family of sequences of subsets of $\{1,2,\cdots,n\}$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2018 at 17:17 | vote | accept | user173856 | ||
| Jun 1, 2018 at 17:16 | comment | added | user173856 | Gerhard Paseman: Thanks for your answer! | |
| May 29, 2018 at 16:31 | comment | added | Gerhard Paseman | One can refine the lower bound estimate by picking a larger set while guaranteeing each two members intersect in a set of size 3 or larger. One gets a lower bound which is $(1 - c/\sqrt{n})^m$ times $2^{nm - m}$ for some not big constant $c$. Gerhard "Close Enough For Envelope Back" Paseman, 2018.05.29. | |
| May 29, 2018 at 16:19 | history | answered | Gerhard Paseman | CC BY-SA 4.0 |