Timeline for Number of spanning trees in a grid
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2010 at 12:29 | vote | accept | Konrad Swanepoel | ||
| Jan 6, 2010 at 22:23 | comment | added | Konrad Swanepoel | The triangular grid could also be changed to a torus by identifying opposite edges of a hexagonal piece. It's possible that one gets significantly more spanning trees in this way, but I have no proof either way. | |
| Jan 6, 2010 at 16:44 | answer | added | Michael Lugo | timeline score: 4 | |
| Jan 6, 2010 at 16:16 | answer | added | Joseph Malkevitch | timeline score: 1 | |
| Jan 6, 2010 at 14:38 | comment | added | Boris Bukh | The cause of beauty forces me to change the problem to the toroidal grid. Then you will have an action of $Z_m^2$ to simplify your calculations. I do not see how to show that tweaking the problem in this manner introduces only an insignificant error, though. | |
| Jan 6, 2010 at 7:13 | answer | added | Martin Rubey | timeline score: 9 | |
| Dec 10, 2009 at 23:47 | answer | added | Steve Huntsman | timeline score: 8 | |
| Dec 10, 2009 at 23:19 | history | asked | Konrad Swanepoel | CC BY-SA 2.5 |