Indestructive deletions of edges from graphs

Authors

B. Bollobás, Faculty of MathematicsFollow
D. L. Goldsmith, Western Michigan University
D. R. Woodall, University of Nottingham

Abstract

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

Recommended Citation

Bollobás, B., Goldsmith, D., & Woodall, D. (1981). Indestructive deletions of edges from graphs. Journal of Combinatorial Theory, Series B, 30 (3), 263-275. https://doi.org/10.1016/0095-8956(81)90043-5