Timeline for Spanning trees in 3 regular graphs.
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2011 at 14:04 | comment | added | Jeff McGowan | Martin, Yes, you would definitely need assumptions to get either thing to always be true, we are not expecting that. Our arguments are probabilistic, in that we look at what happens as the number of vertices goes to infinity, in which case the probability of certain things happening goes to 1. For example, as you probably know, the probability that there is a Hamiltonian cycle in a 3 regular graph goes to 1 as the size goes to infinity. Your construction is very nice, it's giving me some ideas about how to imagine taking a given spanning tree and rearranging into another tree...Thanks! | |
| Sep 18, 2011 at 9:18 | history | answered | Martin Tancer | CC BY-SA 3.0 |