Timeline for number of weighted trivalent trees
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2011 at 20:30 | vote | accept | Aleksey | ||
| Jun 6, 2011 at 12:35 | answer | added | Paul Johnson | timeline score: 3 | |
| Jun 5, 2011 at 5:18 | answer | added | Dan Petersen | timeline score: 7 | |
| Jun 5, 2011 at 3:57 | comment | added | Gerhard Paseman | I initially interpreted a labeling as placing a 6 next to each vertex; now I see it as placing 0!=1 to vertices of degree 3, 1 to degree 4 vertices, 2 to degree 5 vertices, and so on. I think there is a condition that is left out, perhaps determining how leaves are placed, that might relate this to number of spanning trees. Gerhard "Ask Me About System Design" Paseman, 2011.06.04 | |
| Jun 5, 2011 at 3:15 | comment | added | Richard Stanley | Could you clarify? I cannot see how to interpret your question to get 27 such trees with five marked points. | |
| Jun 5, 2011 at 1:12 | history | asked | Aleksey | CC BY-SA 3.0 |