Given a graph with n vertices and a positive integer m that is less than n, prove that the graph contains a set of m+1 vertices in which the difference between the largest degree of any vertex in the set and the smallest degree of any vertex in the set is at most mā1. combinatoricsgraph theoryExtremal Graph TheoryIMO ShortlistIMO Longlist