Timeline for Low rate c-uniform pairwise intersecting set systems
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2011 at 20:22 | vote | accept | CommunityBot | ||
| May 20, 2011 at 20:22 | history | bounty ended | TMM | ||
| May 17, 2011 at 20:21 | comment | added | Gerhard Paseman | If you use q a prime or a power of a prime, then you can replace p+1 > c/2 with something like q+1 > 9c/10, or maybe 8c/9. Small cases plus estimates by Dusart should make something like 8c/9 apply in full generality. Gerhard "Ask Me About System Design" Paseman, 2011.05.17 | |
| May 17, 2011 at 20:19 | comment | added | Clinton Conley | This is so much more reasonable than the approach in my answer! But I think it makes more sense just to have a huge number of pairwise disjoint sets of size $c-p-1$ and take as the sets in your family all unions of a line with one of these new sets (there's no reason for the new sets to correspond with the lines). This makes the "clearly the best $V$" part of your argument a little bit more clear (for me, anyway). | |
| May 17, 2011 at 20:04 | history | answered | Thomas Kalinowski | CC BY-SA 3.0 |