Prove that every tree has at most one perfect matching.

Since every tree with 2 or more vertices is 2-chromatic. We see that a tree with even no. of vertices will have perfect matching as all vertices with the same color can be grouped together and a matching can be established between the two groups. If the tree has odd number of vertices,then no perfect matching can be established for obvious reason.    [proved
]

Comments

Popular posts from this blog

Show that number of pendant vertices in a binary tree is (n+1)/2 ,where n is the number of vertices in the tree.

Prove that every tree with 2 or more vertices is 2-chromatic.

Top 5 websites to learn coding Online