Timeline for Bound on cardinality of a union
Current License: CC BY-SA 2.5
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 29, 2009 at 20:41 | vote | accept | Vigleik Angeltveit | ||
Oct 29, 2009 at 11:51 | answer | added | gowers | timeline score: 9 | |
Oct 29, 2009 at 0:40 | answer | added | Hugh Thomas | timeline score: 5 | |
Oct 28, 2009 at 18:46 | comment | added | Vigleik Angeltveit | A straightforward application of inclusion-exclusion, ignoring the terms of the wrong sign, gives a lower bound. But it will generally be far from optimal. | |
Oct 28, 2009 at 18:38 | answer | added | Kevin P. Costello | timeline score: 8 | |
Oct 28, 2009 at 17:50 | answer | added | Harald Hanche-Olsen | timeline score: 0 | |
Oct 28, 2009 at 17:44 | answer | added | Hugh Thomas | timeline score: 2 | |
Oct 28, 2009 at 17:17 | comment | added | Qiaochu Yuan | Have you tried wrangling with inclusion-exclusion yet? That gives you a bound, although you have to ignore the terms that are the wrong sign. | |
Oct 28, 2009 at 16:41 | history | asked | Vigleik Angeltveit | CC BY-SA 2.5 |