Mohit Singh
  • Member for 12 years, 2 months
  • Last seen more than 2 years ago
Covering a random graph with spanning trees.
2 votes

Consider the path P of length n. Now replace every edge by n parallel edges. A random tree has $p_e=1/n$ and $p_e=1/(n+1)$ in a random forest for each edge $e$. Now, consider the set E^*. There is a ...

View answer