Timeline for Families of subsets containing every singleton as an intersection
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2012 at 16:26 | vote | accept | Johnny | ||
| Feb 10, 2012 at 7:17 | comment | added | domotorp | Moreover, using Sperner's theorem only ${F \choose F/2}$ intersections can give singletons, so |F| is at least $\log n + \Omega(\log\log n)$. | |
| Feb 9, 2012 at 22:44 | history | edited | Noah Stein | CC BY-SA 3.0 |
(Hopefully) fixed off-by-one error
|
| Feb 9, 2012 at 22:00 | comment | added | Johnny | Thanks Noah. Originally I wanted the exact minimum for $|F|$, but it seems from the responses here that the answer may not be very clean. The problem came up while investigating the reconstruction of certain graphs from partial information and determining how sparse this information can be - I need to see how these constructions fit in with the larger problem now. | |
| Feb 9, 2012 at 21:50 | history | answered | Noah Stein | CC BY-SA 3.0 |