Question: What is wrong with the following proof using mathematical induction of the statement that every tree with n vertices has a path of length n

What is wrong with the following "proof" using mathematical induction of the statement that every tree with n vertices has a path of length n − 1. Basis step: Every tree with one vertex clearly has a path of length 0. Inductive step: Assume that a tree with n vertices has a path of length n − 1, which has u as its terminal vertex. Add a vertex v and the edge from u to v. The resulting tree has n + 1 vertices and has a path of length n. This completes the inductive step.

Step by Step Solution

3.42 Rating (161 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

This proof shows that there exists a tree with n vertices having a ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

923-M-C-M-S (2461).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!