Prove that a simple, connected graph with odd vertices has edge chromatic number $\Delta + 1$ I'm struggling to see how this can be right when I consider the simple example of a three vertex graph such that one vertex has one edge each with the other two vertices. Such a graph is connected and simple with an odd number of vertices and maximum degree two. Edge chromatic number is also two as the graph only needs two colors to color in the two edges. I understand that by Vizing a simple graph will have its edge chromatic number be $\Delta$ or $\Delta + 1$ but the problem is insisting that in the case of a simple, connected graph with odd vertices it will always be $\Delta + 1$ and I'm simply not following how to arrive there with my simple counterexample as proof of the other way around.

You have indeed provided a valid counterexample to the claim. A 2-path is 2-edge-colorable, and it has $\Delta = 2$. Thus, it is not true that any connected graph with an odd number of vertices and $\Delta = 2$ has chromatic index $\Delta+1$.

Indeed, it is known that for any bipartite graph $G$, it holds that $\chi'(G) = \Delta$. That is to say, it does not matter whether the number of vertices is odd or even; if the graph is bipartite, it is 2-edge-colorable.

If this is an exercise, perhaps it is talking about cycles with an odd number of vertices, or something else.