Timeline for Number of spanning trees: bounds from structural parameters
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2011 at 12:43 | comment | added | David Harris | When $e$ is close to $v$, the bound $\binom{e}{v-1}$ is stronger. Are there any stronger upper bounds than this for the case when $e$ is small? | |
| Oct 22, 2010 at 10:16 | vote | accept | CommunityBot | ||
| Oct 22, 2010 at 1:51 | history | edited | Gerry Myerson | CC BY-SA 2.5 |
Added some references
|
| Oct 22, 2010 at 1:39 | history | answered | Gerry Myerson | CC BY-SA 2.5 |