Question

show that every simple finite graph has two vettices of the same degree?​

Answer 1

Answer:

This can be shown using the pigeon hole principle. Assume that the graph has n vertices. ... Thus the vertices can have at most n − 1 different degrees, but since there are n vertices, at least two must have the same degree.