Timeline for Number of spanning subgraphs of the complete bipartite graph $K(m,n)$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 7, 2016 at 12:37 | history | suggested | MR_BD | CC BY-SA 3.0 |
edit latex
|
| Nov 7, 2016 at 12:16 | review | Suggested edits | |||
| S Nov 7, 2016 at 12:37 | |||||
| Feb 15, 2013 at 2:11 | comment | added | Austin Mohr | If you are indeed interested in just spanning trees of $K(m,n)$, then you may find more information at www.austinmohr.com/work (under "Master's Thesis"). Moreover, the algorithm used to enumerate the trees should be easy to adapt to counting any sort of subgraph, though the runtime will suffer. There is a polytime algorithm for determining isomorphism between trees, but there is not yet one for general graphs. | |
| Jun 5, 2012 at 2:14 | vote | accept | Gustavus Simmons | ||
| Jun 3, 2012 at 16:34 | answer | added | Igor Rivin | timeline score: 5 | |
| Jun 3, 2012 at 16:23 | history | asked | Gustavus Simmons | CC BY-SA 3.0 |