Random Graphs Containing Few Disjoint Excluded Minors
The Erdos-Pósa theorem (1965) states that in each graph G which contains at most k disjoint cycles, there is a 'blocking' set B of at most f(k) vertices such that the graph G - B is acyclic. Robertson and Seymour (1986) give an extension concerning any minor-closed class \documentclass{art...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
2014
|