Timeline for on counting of special case of trees on a graph
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3, 2010 at 15:07 | comment | added | Tony Huynh | But eabc is not a spanning edge-tree, since it contains abc which is an edge cycle. | |
| Sep 3, 2010 at 15:03 | comment | added | Douglas S. Stones | I thought this too initially (but it's not right). Take the 3-cycle on vertices {a,b,c}, add a vertex e and an edge between a and e. Then eabc and eacb are both spanning trees whose endpoints are not adjacent. | |
| Sep 3, 2010 at 14:56 | comment | added | Gjergji Zaimi | I don't think the edge trees are required to be spanning trees. | |
| Sep 3, 2010 at 14:47 | history | answered | Nekura | CC BY-SA 2.5 |