Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Is the following statement true or false:
"One or both the edges with the third smallest and the fourth smallest edges are part of any MST of G."
-----------------
Nothing else is given in the above question. Now is this statement true or false? Does having a connected graph with only 2 edges, make this statement false? I am not actually getting it. If the graph itself has only two edges, then no point of having the third or fourth minimum edge weight in the MST, as they do not exist.