Random unlabelled graphs containing few disjoint cycles.
We call a set B of vertices in a graph G a blocker if the graph G - B obtained from G by deleting the vertices in B has no cycles. The classical Erdos-Pósa theorem (1965) states that for each positive integer k there is a positive integer f(k) such that in each graph G which contains at most k pairw...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2011
|