Connectivity of graphs that do not have the edge-Erdos-P\'osa property
Abstract
We show that we can assume graphs that do not have the edge-Erdos-P\'osa 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.