Minimum independence number of graphs with specified degree sequences

In this thesis we consider the lower bound on a graph's independence number in terms of the degree sequence of the graph. We present three functions of the degree sequence which are known lower bounds on independence number and compare them. We show that one of these functions, the residue, is often best possible. We determine explicitly the best possible lower bound on independence number of graphs realizing a given semi-regular degree sequence.