Will the minimum spanning tree not have only those edges specified by the cycle property? I have just started to understand the "Minimum Spanning Trees" (MSTs), and had come across the cycle property. I am referring to the book - Algorithm Design by Jon Kleinberg and Eva Tardos. The statement of the property as written in the book is:


  Assume that all edge costs are distinct. Let C be any cycle in G, and let edge e = (v,w) be the most expensive edge belonging to C. Then e does not belong to any minimum spanning tree.


Now my doubt is: Are the edges of a graph (undirected graph with edges having distinct positive weights) that do not satisfy the cycle property the only ones which aren't present in the MST or will there be any other edges that don't belong to the MST and aren't covered by this property?

I am unable to come up with a proof to argue about whether such edges exist or not. Can some please give a proof for this?
Sorry if I didn't understand your question, but what I think you meant to ask is, whether it is possible for an edge to not be in a MST if this edge is not in a cycle.

Here's my answer.

Let us assume that we have an edge (u,v) in a graph G, that isn't part of a cycle. This would mean that there is no path from u to v that isn't the edge (u,v).
If the edge (u,v) weren't in the MST, this would mean that there is no path from u to v in this MST, meaning that the MST would be disconnected, and thus not an MST at all.
Hence if an edge is not part of a cycle, it must be in the MST of the graph.