Timeline for Counting $(n,k)$-forests of binary trees
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2011 at 7:36 | history | edited | user47274 |
edited tags
|
|
| Jul 13, 2010 at 21:27 | vote | accept | user47274 | ||
| Jul 13, 2010 at 17:22 | answer | added | Jim Belk | timeline score: 8 | |
| Jul 13, 2010 at 15:34 | comment | added | Martin Rubey | I think you want to use Lagrange inversion. See Stanley ECII, Theorem 5.4.2. | |
| Jul 13, 2010 at 15:21 | history | asked | user47274 | CC BY-SA 2.5 |