# Can two minimum spanning trees for a same graph has different number edges?

(1) Let's say $T_1$ has $r$ number of edges and $T_2$ has $s$ number of edges; where $r \ne s$ but two trees has same weight since they both are MST.

I kind feel this kind not be true because to span $n$ vertices with minimum number of edges, we need $n-1$ edges. so MST must have at least $n-1$ edges; if some MST has more than $n-1$ edges, then there must exists a cycle which leads to non-MST.

However, I don't know how to show that if the number of edges is greater or equal to the number of vertices of an an undirected, connected graph $G$, then $G$ has a cycle.

What if the graph is directed? Is this hold as well?

Any hint?

The answer is no. When running an algorithm for finding MST, It is first of all a tree, it has |v| - 1 edges $exactly$.
{"ft_lang_label":"__label__en","ft_lang_prob":0.96320254,"math_prob":0.99937564,"size":631,"snap":"2019-43-2019-47","text_gpt3_token_len":179,"char_repetition_ratio":0.14832535,"word_repetition_ratio":0.0,"special_character_ratio":0.28209192,"punctuation_ratio":0.097222224,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9994679,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T01:07:58Z\",\"WARC-Record-ID\":\"<urn:uuid:91761a86-6c3b-4ab5-b03d-cb6c6eba3b33>\",\"Content-Length\":\"132102\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:223ac813-ccab-4216-8967-9ed6d5a6bfa5>\",\"WARC-Concurrent-To\":\"<urn:uuid:17121ec2-79fb-455f-817b-c36cb5e8d859>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://cs.stackexchange.com/questions/79681/can-two-minimum-spanning-trees-for-a-same-graph-has-different-number-edges/79682\",\"WARC-Payload-Digest\":\"sha1:ZHMO4RXEE2VLTBKZBOTWTETLWTDDJQQ7\",\"WARC-Block-Digest\":\"sha1:QIESTEPXPF6WZQNJQJXJPXRQN5SHTTPE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496664469.42_warc_CC-MAIN-20191112001515-20191112025515-00279.warc.gz\"}"}