Timeline for Number of spanning subgraphs of $K_n$ with given number of edges and connected components
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2012 at 2:10 | vote | accept | Adam | ||
| Jun 9, 2012 at 2:10 | comment | added | Adam | Thanks...nice to have a response straight from the horse's mouth, as it were! Especially as a recurrence relation is exactly what I'm looking for... Thankyou Gwyn as well. Lots to think about. | |
| Jun 8, 2012 at 14:25 | comment | added | Ira Gessel | It's unlikely that you can find any formulas for these numbers that can't be derived easily from the generating function. One thing that you can do is find a fairly simple recurrence by differentiating the generating function. | |
| Jun 7, 2012 at 19:44 | answer | added | Gwyn Whieldon | timeline score: 2 | |
| Jun 7, 2012 at 16:53 | history | asked | Adam | CC BY-SA 3.0 |