Indestructive deletions of edges from graphs


If G is a graph on p vertices with connectivity, or edge-connectivity, or minimum valency, at least k, we ask how many edges one can delete from G without reducing the appropriate quantity below k -1. When p and k are large, our answers are about 1 4p, 1 8p, and 1 2p, respectively; we conjecture that the correct (best possible) answer is about 1 2p in each case. © 1981.

Publication Title

Journal of Combinatorial Theory, Series B