Timeline for How to keep subsets disjoint?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2011 at 21:14 | comment | added | Sergey Norin | @Seva: In Alon & Frankl's paper it is shown that for families of subsets of size $m=2^{(1/2+\delta)n}$ the number of pairs is at most $m^{2 - \delta^2/2}$. This is not exact, but does provide some information. It would be interesting to improve on this bound and a quick internet search provided no indication that anybody did. | |
| Apr 11, 2011 at 20:27 | history | edited | Sergey Norin | CC BY-SA 3.0 |
added 8 characters in body
|
| Apr 11, 2011 at 20:14 | comment | added | Seva | I am excited to learn that the problem dates back to Erdos, and that it was studied in a 25+ year old paper by Alon and Frankl! On the other hand, upon looking at their paper, it seems to give a strong conclusion for $k$ "small", but does not address the case where $k$ is about $2^{\gamma n}$ with $\gamma>1/2$. | |
| Apr 11, 2011 at 18:27 | history | answered | Sergey Norin | CC BY-SA 3.0 |