Timeline for Minimal number of n/2-subsets of [n] that contains every d-subset
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2017 at 1:42 | answer | added | Max Alekseyev | timeline score: 4 | |
| Nov 1, 2017 at 12:44 | comment | added | Sam Hopkins | There were some developments in non-uniform hypergraph packing discussed by Terry Tao here (terrytao.wordpress.com/2014/12/16/long-gaps-between-primes) that may be relevant to this question. | |
| Nov 1, 2017 at 12:41 | comment | added | Sam Hopkins | The phrases "Erd\H{o}s-Hanani conjecture" and "packing in a hypergraph" (en.wikipedia.org/wiki/Packing_in_a_hypergraph) will help you out. | |
| Nov 1, 2017 at 12:40 | comment | added | Sam Hopkins | Related: mathoverflow.net/questions/121961/… | |
| Nov 1, 2017 at 12:11 | answer | added | Fedor Petrov | timeline score: 5 | |
| Nov 1, 2017 at 3:15 | answer | added | Dustin G. Mixon | timeline score: 5 | |
| Nov 1, 2017 at 3:07 | comment | added | Zach Teitler | math.stackexchange.com/questions/1781171/… | |
| Nov 1, 2017 at 0:59 | history | asked | hao chen | CC BY-SA 3.0 |