« first day (1565 days earlier)      last day (3170 days later) » 

Quaxton Hale
Quaxton Hale
04:56
Can a graph have more than one maximum spanning tree with the same weight?
D.W.
D.W.
05:29
@QuaxtonHale Try some examples! You'll probably be able to figure it out...
Quaxton Hale
Quaxton Hale
It seems possible, since there can be multiple minimum spanning trees
Quaxton Hale
Quaxton Hale
05:43
Right,. when all edges have the same weight.
 
9 hours later…
vzn
vzn
15:04
in theory salon, 43 mins ago, by vzn
Teaching Theory in the time of Data Science/Big Data / Gilbert/ Rudra
Raphael
Raphael
15:34
@QuaxtonHale You may be interested in this one:
15
Q: Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?

Aden DongIf a weighted graph $G$ has two different minimum spanning trees $T_1 = (V_1, E_1)$ and $T_2 = (V_2, E_2)$, then is it true that for any edge $e$ in $E_1$, the number of edges in $E_1$ with the same weight as $e$ (including $e$ itself) is the same as the number of edges in $E_2$ with the same wei...

graph-theory spanning-trees weighted-graphs
@QuaxtonHale Quite right, that's the easiest example. $K_n$ with unit weights has ... many equally good spanning trees.
Uh, that question has been on my todo list for a while...

« first day (1565 days earlier)      last day (3170 days later) »