The edge removal problem studies the impact of a single link or "edge" on the capacity of a communication network.  Specifically, the question is whether removing a single edge from a larger network ever reduces the network capacity by more than the capacity of the removed edge.  While the edge removal problem has been studied primarily for networks of noiseless links, recent work by Noorzad et al. applies the edge removal question as a tool for studying communication in more general memoryless networks where broadcast, interference, noise, and so on may play a role.  In this work, tools for bounding the impact of edge removal in general networks are derived, and the relationship to the edge removal problem for noiseless networks is explored.