Timeline for Minimal number of n/2-subsets of [n] that contains every d-subset
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 1, 2017 at 14:15 | comment | added | Sam Hopkins | Eliminating this log factor may however be very difficult. See my comments to the OP above. | |
| Nov 1, 2017 at 13:12 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 74 characters in body
|
| Nov 1, 2017 at 12:11 | history | answered | Fedor Petrov | CC BY-SA 3.0 |