@article{McDiarmid2014RandomGC, title={Random graphs containing few disjoint excluded minors}, author={Colin McDiarmid and Valentas Kurauskas}, journal={Random Struct. Algorithms}, year={2014}, volume={44}, pages={240-268} }

- Published 2014 in Random Struct. Algorithms
DOI:10.1002/rsa.20447

The Erdős-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 A of graphs, as long as A does not contain all planar graphs: in each graph G which contains at most k disjoint excluded minors for A, there is a set B of at most g(k) vertices such that G−B is in A. In an earlier paper [?], we… CONTINUE READING

### Presentations referencing similar topics