Random graphs with few disjoint cycles
The classical Erd\H{o}s-P\'{o}sa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k+1 disjoint cycles, there is a blocker of size at most f(k); that is, a set B of at most f(k) vertices such that G-B has no cycles. We show that, amo...
| Prif Awduron: | , |
|---|---|
| Fformat: | Journal article |
| Iaith: | English |
| Cyhoeddwyd: |
2010
|