Tony Huynh, A tight Erdős-Pósa function for planar minors
Room B109 IBS (기초과학연구원)Let H be a planar graph. By a classical result of Robertson and Seymour, there is a function f(k) such that for all k and all graphs G, either G contains k vertex-disjoint subgraphs each containing H as a minor, or there is a subset X of at most f(k) vertices such that G−X has …