A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges.
Prove or disprove: There exists a finite, undirected, simple graph with at least two vertices in which each vertex has a different degree. To give a proof it suffices to draw an example of such a graph. To disprove the result, you should provide an argument as to why such a graph cannot exist.
