Random unlabelled graphs containing few disjoint cycles

Abstract

AbstractWe 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 Erdős‐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 pairwise vertex‐disjoint cycles, there is a blocker B of size at most f(k).We show that, amongst all unlabelled n‐vertex graphs with at most k disjoint cycles, all but an exponentially small proportion have a unique blocker of size k. We also determine the asymptotic number and properties of such graphs. For example we study the limiting probability that such graphs are connected, the limiting average number of vertices not in the giant component, and the limiting distribution of the chromatic number. Further, we give more detailed results concerning graphs with no two disjoint cycles.These results complement recent results for labelled graphs by Kurauskas and the second author. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2011