Timeline for Bijectively counting labeled trees by number of leaves
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 31, 2022 at 4:26 | history | became hot network question | |||
| Mar 30, 2022 at 23:10 | vote | accept | Sam Hopkins | ||
| Mar 30, 2022 at 23:07 | answer | added | Peter Taylor | timeline score: 5 | |
| Mar 30, 2022 at 22:01 | comment | added | Sam Hopkins | @PeterTaylor: Oh dear, I think you're right, I don't know how I missed that! If you post that as an answer I'll happily accept it. | |
| Mar 30, 2022 at 21:59 | comment | added | Peter Taylor | If you attach a vertex $n+1$ to the root then isn't the Prüfer code of the resulting tree a sequence of $n-1$ integers from $[n]$, none of which is one of the leaves, and which includes all of the non-leaves? | |
| Mar 30, 2022 at 20:26 | history | asked | Sam Hopkins | CC BY-SA 4.0 |