Timeline for Spanning trees of $k$-edge-connected graphs
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2011 at 12:22 | history | bounty ended | David Harris | ||
| Aug 5, 2011 at 11:41 | history | bounty started | David Harris | ||
| Aug 5, 2011 at 11:41 | history | edited | David Harris | CC BY-SA 3.0 |
added 101 characters in body; edited title
|
| Aug 2, 2011 at 20:20 | answer | added | Gjergji Zaimi | timeline score: 5 | |
| Jun 23, 2011 at 18:02 | history | edited | David Harris | CC BY-SA 3.0 |
edited title
|
| Jun 23, 2011 at 17:46 | history | edited | David Harris | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Jun 23, 2011 at 17:20 | comment | added | Noam D. Elkies | Shouldn't the number $t$ of connected components always be 1 if the graph is $k$-edge-connected for some $k>0$? | |
| Jun 23, 2011 at 16:32 | history | asked | David Harris | CC BY-SA 3.0 |