  Suppose that one can destroy all 100-gons in a graph by removing 2019 edges.
How many edges must be removed to destroy all 100-gons in such a way that the
set of removed edges is invariant with respect to all automorphisms the initial
graph? This paper contains solutions to such kind of problems. Several open
questions are raised.
