加载中…
In the 1960s, Erd\H{o}s and P'osa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such a duality for -expansions in graphs if and only if is a planar graph (this includes the previous result for ). We consider vertex labelled graphs and minors and provide such a characterisation for -connected labelled graphs .

生成讲解博客的中文版本

生成AI智能校验的中文版本