Timeline for Number of blocks in a t-(v,k,l) design with empty intersection with a given set U [closed]
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2013 at 13:38 | history | closed |
Douglas Zare Carlo Beenakker Chris Godsil Daniel Moskovich Andrey Rekalo |
Not suitable for this site | |
| Jul 22, 2013 at 9:32 | review | Close votes | |||
| Jul 22, 2013 at 13:38 | |||||
| Feb 24, 2013 at 21:11 | answer | added | Yury Ionin | timeline score: 2 | |
| Jun 21, 2012 at 23:57 | comment | added | Cindy | Oh and I apologize for mixing up the two sites. | |
| Jun 21, 2012 at 23:48 | comment | added | Cindy | Chris you are right, it had to be a t. Using Incl. Excl. I get a summation which will not reduce tto the given answer? | |
| Jun 21, 2012 at 23:46 | history | edited | Cindy | CC BY-SA 3.0 |
x t
|
| Jun 21, 2012 at 22:58 | comment | added | Gerry Myerson | This website is for questions with a research interest. This question is presented more as an exercise, so I think a better place for it is math.stackexchange.com. | |
| Jun 21, 2012 at 22:08 | comment | added | Chris Godsil | @Cindy: Is your $x$ meant to be a $t$, i.e., is $u≤t$? If not the result is false. If it is then it can be proved by inclusion-exclusion, and this would not be an unreasonable exercise for a design theory course. | |
| Jun 21, 2012 at 21:21 | history | asked | Cindy | CC BY-SA 3.0 |