Timeline for Set system with prescribed intersection sizes
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2017 at 11:57 | comment | added | Daniel Soltész | Yes it does! It also says that one can't achieve $\sim n^3$ in the second setting, as using the notation of the paper, there we have $l=2$ and $l'=1$ so the maixmal order of magnitude is $\sim n^2$. This can be achieved by dividing the ground set into two parts of size n/2: the left and the right part. We further divide the right part into disjoint "blocks" of size $k-1$. Then take every set that contains one element on the left side and one block on the right. | |
| Feb 11, 2017 at 11:50 | vote | accept | Daniel Soltész | ||
| Feb 9, 2017 at 12:25 | history | answered | karpasi | CC BY-SA 3.0 |