Timeline for What is the largest family F of subsets of [n] for which any two distinct sets A and B in F have an intersection of size at most min(|A|,|B|)/2?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2011 at 7:59 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
deleted 1 characters in body
|
| Jan 13, 2011 at 5:58 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
added 224 characters in body
|
| Jan 13, 2011 at 5:45 | vote | accept | Douglas S. Stones | ||
| Jan 13, 2011 at 5:38 | comment | added | Chris Eagle | Doing the same thing with $l$-dimensional flats gives you a family of size $O(n^{l+1})$. | |
| Jan 13, 2011 at 5:33 | comment | added | Douglas S. Stones | Thanks for that, that's exactly what I'm after. (...and now I'm slapping myself for not realising this already) | |
| Jan 13, 2011 at 5:26 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
added 244 characters in body; added 219 characters in body; deleted 1 characters in body
|
| Jan 13, 2011 at 5:12 | history | answered | Aaron Meyerowitz | CC BY-SA 2.5 |