The Erdos-P\'osa property for infinite graphs
Abstract
We investigate which classes of infinite graphs have the Erdos-P\'osa property (EPP). In addition to the usual EPP, we also consider the following infinite variant of the EPP: a class G of graphs has the -EPP, where is an infinite cardinal, if for any graph there are either disjoint graphs from G in or there is a set X of vertices of of size less than such that - X contains no graph from G. In particular, we study the (-)EPP for classes consisting of a single infinite graph G. We obtain positive results when the set of induced subgraphs of G is labelled well-quasi-ordered, and negative results when G is not a proper subgraph of itself (both results require some additional conditions). As a corollary, we obtain that every graph which does not contain a path of length n for some n ∈ N has the EPP and the -EPP. Furthermore, we show that the class of all subdivisions of any tree T has the -EPP for every uncountable cardinal , and if T is rayless, also the 0-EPP and the EPP.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.