How local irregularity gets global in a graph

We prove asymptotically tight bounds on the difference between the maximum degree and the minimum degree of a simple graph in terms of its order and of the maximum difference between the degrees of adjacent vertices. Examples showing tightness and a conjecture are presented. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 18–23, 2002