- #1
Superyoshiom
- 29
- 0
We learned in class how to do this problem the more traditional way, but we are required to reprove this using induction, which I'm not too sure how to do.
My Attempt: For the base case I had three vertices connected by three edges, with the last one looping back to the first to create a cycle of edge length three. I said this was bipartite since you could color the two vertices that weren't adjacent red and the middle one blue and no two vertices of the same color would be adjacent to each other. However, I'm not too sure how to proceed from there for the inductive step.
My Attempt: For the base case I had three vertices connected by three edges, with the last one looping back to the first to create a cycle of edge length three. I said this was bipartite since you could color the two vertices that weren't adjacent red and the middle one blue and no two vertices of the same color would be adjacent to each other. However, I'm not too sure how to proceed from there for the inductive step.