Saturation Numbers for Nearly Complete Graphs.

An upper bound on the saturation number for graphs as well as associated extremal graphs was given by (Kászonyi and Tuza in J. Graph Theory, 10:203-210, ). A minor improvement of that result, which was implied in their paper, will be stated. Using this result, a series of exact saturation numbers and associated extremal graphs will be proved for the nearly complete graphs K − E( L), where L is a graph of order at most 4. [ABSTRACT FROM AUTHOR]