Timeline for Pairwise intersecting sets of fixed size
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2011 at 19:20 | comment | added | Dave Pritchard | I believe the best known bound is given by Tuza (Tuza, Z. (1985) Critical hypergraphs and intersecting set-pair systems. J. Combin. Theory Ser. B 39 134–145), at a coarse level it is $N(k)=\Theta(4^k/\sqrt{k})$ | |
| Feb 7, 2011 at 15:32 | answer | added | Zsbán Ambrus | timeline score: 3 | |
| Apr 16, 2010 at 15:55 | answer | added | Zsbán Ambrus | timeline score: 7 | |
| Apr 16, 2010 at 15:39 | vote | accept | Zsbán Ambrus | ||
| Apr 16, 2010 at 8:29 | answer | added | Pietro | timeline score: 1 | |
| Apr 15, 2010 at 9:04 | answer | added | gowers | timeline score: 10 | |
| Apr 14, 2010 at 18:35 | history | edited | Zsbán Ambrus | CC BY-SA 2.5 |
fix phrasing of lemma 2
|
| Apr 14, 2010 at 14:53 | comment | added | François G. Dorais | It's even more remarkable that the arguments were all the same. I also independently came up with the same argument, but I didn't post when I saw the flaw. I wonder just how many people did the exact same thing... | |
| Apr 14, 2010 at 14:50 | answer | added | François G. Dorais | timeline score: 3 | |
| Apr 14, 2010 at 14:30 | comment | added | Ben Webster♦ | He deleted it. This question is remarkable in having 3 deleted (wrong?) answers from very smart people. | |
| Apr 13, 2010 at 19:04 | history | edited | Zsbán Ambrus |
edited tags
|
|
| Apr 13, 2010 at 18:55 | history | asked | Zsbán Ambrus | CC BY-SA 2.5 |