Connectivity of graphs that do not have the edge-Erdős-Pósa property

Abstract

We show that we can assume graphs that do not have the edge-Erdős-Pósa property to be connected. Then we strengthen this result to $2$-connectivity under the additional assumptions of a minor-closed property and a generic counterexample.