Timeline for Large Intersecting Subsets of a Set
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 24, 2012 at 19:10 | comment | added | Gerhard Paseman | Although nowhere near as nice as the lower bound argument used by Kevin Costello, one can use small cases to get that the lower bound for n > 4 is bigger than 7n/4 just to get 5 or more sets of size n to have "small" intersections. Such observations build my faith in Kevin's conclusion. Gerhard "Ask Me About Small Examples" Paseman, 2012.10.24 | |
| Oct 24, 2012 at 5:22 | comment | added | Gerhard Paseman | Running through small test cases in my head leads me to think that 2n for n odd and 2n-1 for n even is how it will turn out. Gerhard "Leaving The Proof To Others" Paseman, 2012.10.23 | |
| Oct 24, 2012 at 5:04 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |