Timeline for Number of spanning trees in a grid
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2010 at 12:29 | vote | accept | Konrad Swanepoel | ||
| Jan 7, 2010 at 20:56 | comment | added | Konrad Swanepoel | Or for a regular hexagonal region. This should be the shape giving the largest number of minimal spanning trees for n points in the triangular lattice. I'm not so sure about the square lattice, but here the maximum number of spanning trees among n points is probably for square shapes. | |
| Jan 7, 2010 at 12:46 | comment | added | Martin Rubey | would be nice if somebody had the energy to work out a nice formula for the number of spanning trees in a triangular region of the triangular grid. | |
| Jan 7, 2010 at 12:41 | history | edited | Martin Rubey | CC BY-SA 2.5 |
added 492 characters in body
|
| Jan 6, 2010 at 18:56 | history | edited | Martin Rubey | CC BY-SA 2.5 |
add reference for triangular grid
|
| Jan 6, 2010 at 7:13 | history | answered | Martin Rubey | CC BY-SA 2.5 |